./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 14660901cc5c4d61dda44d0e62586d716b569100 ............................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 14660901cc5c4d61dda44d0e62586d716b569100 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:21:07,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:21:07,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:21:07,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:21:07,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:21:07,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:21:07,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:21:07,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:21:07,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:21:07,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:21:07,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:21:07,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:21:07,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:21:07,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:21:07,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:21:07,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:21:07,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:21:07,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:21:07,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:21:07,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:21:07,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:21:07,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:21:07,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:21:07,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:21:07,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:21:07,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:21:07,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:21:07,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:21:07,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:21:07,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:21:07,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:21:07,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:21:07,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:21:07,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:21:07,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:21:07,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:21:07,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:21:07,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:21:07,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:21:07,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:21:07,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:21:07,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:21:07,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:21:07,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:21:07,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:21:07,347 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:21:07,347 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:21:07,347 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:21:07,348 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:21:07,348 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:21:07,349 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:21:07,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:21:07,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:21:07,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:21:07,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:21:07,350 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:21:07,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:21:07,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:21:07,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:21:07,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:21:07,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:21:07,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:21:07,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:21:07,352 INFO L138 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/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 -> 14660901cc5c4d61dda44d0e62586d716b569100 [2019-12-07 12:21:07,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:21:07,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:21:07,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:21:07,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:21:07,471 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:21:07,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:07,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/052f32238/4290b1fbfdb049cbb4ff797dd254cdcc/FLAG085be2c92 [2019-12-07 12:21:07,983 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:21:07,984 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:07,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/052f32238/4290b1fbfdb049cbb4ff797dd254cdcc/FLAG085be2c92 [2019-12-07 12:21:08,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/052f32238/4290b1fbfdb049cbb4ff797dd254cdcc [2019-12-07 12:21:08,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:21:08,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:21:08,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:08,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:21:08,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:21:08,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e24b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08, skipping insertion in model container [2019-12-07 12:21:08,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:21:08,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:21:08,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:08,658 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:21:08,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:08,676 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:21:08,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08 WrapperNode [2019-12-07 12:21:08,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:08,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:08,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:21:08,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:21:08,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:08,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:21:08,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:21:08,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:21:08,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... [2019-12-07 12:21:08,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:21:08,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:21:08,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:21:08,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:21:08,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 [2019-12-07 12:21:08,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:21:08,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:21:08,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:21:08,841 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:21:08,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:08 BoogieIcfgContainer [2019-12-07 12:21:08,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:21:08,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:21:08,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:21:08,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:21:08,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:21:08" (1/3) ... [2019-12-07 12:21:08,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d8d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:08, skipping insertion in model container [2019-12-07 12:21:08,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:08" (2/3) ... [2019-12-07 12:21:08,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d8d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:08, skipping insertion in model container [2019-12-07 12:21:08,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:08" (3/3) ... [2019-12-07 12:21:08,846 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:08,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:21:08,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:21:08,863 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:21:08,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:21:08,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:21:08,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:21:08,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:21:08,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:21:08,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:21:08,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:21:08,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:21:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-12-07 12:21:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:21:08,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:08,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:21:08,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1497591, now seen corresponding path program 1 times [2019-12-07 12:21:08,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:21:08,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042662120] [2019-12-07 12:21:08,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:08,977 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:21:08,977 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:21:08,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:21:08 BoogieIcfgContainer [2019-12-07 12:21:08,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:21:08,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:21:08,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:21:08,993 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:21:08,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:08" (3/4) ... [2019-12-07 12:21:08,996 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:21:08,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:21:08,998 INFO L168 Benchmark]: Toolchain (without parser) took 499.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -102.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:08,998 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:08,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:08,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:09,000 INFO L168 Benchmark]: Boogie Preprocessor took 10.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:09,001 INFO L168 Benchmark]: RCFGBuilder took 133.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:09,001 INFO L168 Benchmark]: TraceAbstraction took 150.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:09,002 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:09,005 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 133.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 150.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 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 someBinaryDOUBLEComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 1.6; VAL [__return_main=0] [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] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L25] __VERIFIER_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 12:21:10,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:21:10,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:21:10,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:21:10,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:21:10,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:21:10,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:21:10,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:21:10,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:21:10,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:21:10,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:21:10,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:21:10,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:21:10,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:21:10,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:21:10,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:21:10,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:21:10,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:21:10,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:21:10,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:21:10,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:21:10,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:21:10,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:21:10,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:21:10,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:21:10,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:21:10,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:21:10,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:21:10,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:21:10,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:21:10,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:21:10,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:21:10,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:21:10,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:21:10,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:21:10,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:21:10,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:21:10,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:21:10,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:21:10,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:21:10,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:21:10,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 12:21:10,374 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:21:10,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:21:10,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:21:10,375 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:21:10,375 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:21:10,375 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:21:10,375 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:21:10,376 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:21:10,376 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:21:10,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:21:10,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:21:10,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:21:10,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:21:10,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:21:10,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:21:10,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:21:10,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:21:10,380 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 -> 14660901cc5c4d61dda44d0e62586d716b569100 [2019-12-07 12:21:10,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:21:10,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:21:10,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:21:10,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:21:10,572 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:21:10,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:10,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/a09e1068f/d35e220ec83e4141b1ce9895f6dcc6c3/FLAG54690c452 [2019-12-07 12:21:11,086 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:21:11,087 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:11,090 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/a09e1068f/d35e220ec83e4141b1ce9895f6dcc6c3/FLAG54690c452 [2019-12-07 12:21:11,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/data/a09e1068f/d35e220ec83e4141b1ce9895f6dcc6c3 [2019-12-07 12:21:11,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:21:11,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:21:11,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:11,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:21:11,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:21:11,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2329897b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11, skipping insertion in model container [2019-12-07 12:21:11,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:21:11,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:21:11,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:11,734 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:21:11,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:11,753 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:21:11,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11 WrapperNode [2019-12-07 12:21:11,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:11,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:11,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:21:11,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:21:11,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:11,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:21:11,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:21:11,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:21:11,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... [2019-12-07 12:21:11,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:21:11,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:21:11,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:21:11,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:21:11,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 [2019-12-07 12:21:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:21:11,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:21:15,798 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:21:15,799 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:21:15,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:15 BoogieIcfgContainer [2019-12-07 12:21:15,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:21:15,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:21:15,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:21:15,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:21:15,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:21:11" (1/3) ... [2019-12-07 12:21:15,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c7c621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:15, skipping insertion in model container [2019-12-07 12:21:15,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:11" (2/3) ... [2019-12-07 12:21:15,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c7c621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:15, skipping insertion in model container [2019-12-07 12:21:15,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:15" (3/3) ... [2019-12-07 12:21:15,804 INFO L109 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2019-12-07 12:21:15,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:21:15,814 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:21:15,822 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:21:15,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:21:15,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:21:15,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:21:15,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:21:15,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:21:15,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:21:15,836 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:21:15,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:21:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-12-07 12:21:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:21:15,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:15,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:21:15,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2019-12-07 12:21:15,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:21:15,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510576625] [2019-12-07 12:21:15,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 [2019-12-07 12:21:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:16,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:21:16,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:21:18,812 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__x~0)) is different from true [2019-12-07 12:21:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:18,816 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:21:22,490 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.eq (fp.div c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) .cse0))) is different from true [2019-12-07 12:21:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:22,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510576625] [2019-12-07 12:21:22,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:22,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:21:22,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764443498] [2019-12-07 12:21:22,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:21:22,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:21:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:21:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2019-12-07 12:21:22,506 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 6 states. [2019-12-07 12:21:31,080 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-12-07 12:21:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:37,402 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-12-07 12:21:37,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:21:37,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-12-07 12:21:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:37,410 INFO L225 Difference]: With dead ends: 17 [2019-12-07 12:21:37,410 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 12:21:37,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=18, Invalid=18, Unknown=2, NotChecked=18, Total=56 [2019-12-07 12:21:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 12:21:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 12:21:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 12:21:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-12-07 12:21:37,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-12-07 12:21:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-12-07 12:21:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:21:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-12-07 12:21:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:21:37,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:37,434 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 12:21:37,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:21:37,636 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 1 times [2019-12-07 12:21:37,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:21:37,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052092653] [2019-12-07 12:21:37,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 [2019-12-07 12:21:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:39,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:21:39,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:21:42,342 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:21:45,108 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:21:50,477 WARN L192 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 12:21:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:21:50,481 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:21:54,991 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2019-12-07 12:21:58,289 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2019-12-07 12:22:00,780 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2019-12-07 12:22:03,479 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2019-12-07 12:22:06,227 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2019-12-07 12:22:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:22:06,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052092653] [2019-12-07 12:22:06,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [418526369] [2019-12-07 12:22:06,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:22:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:22:11,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:22:11,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:22:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:22:11,691 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:22:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:22:11,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004988690] [2019-12-07 12:22:11,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:24:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:24:29,073 WARN L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:24:29,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:24:31,317 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2019-12-07 12:24:34,652 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2019-12-07 12:24:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:24:34,662 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:24:38,686 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) is different from false [2019-12-07 12:24:40,932 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) is different from true [2019-12-07 12:24:43,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 c_ULTIMATE.start_main_~main__x1~0) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 12:24:45,899 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 c_ULTIMATE.start_main_~main__x1~0) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 12:24:48,616 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))))) is different from false [2019-12-07 12:24:51,353 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))))) is different from true [2019-12-07 12:24:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 12:24:51,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:24:51,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 16 [2019-12-07 12:24:51,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945802544] [2019-12-07 12:24:51,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:24:51,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:24:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:24:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=31, Unknown=17, NotChecked=190, Total=272 [2019-12-07 12:24:51,357 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 17 states. [2019-12-07 12:24:54,127 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse3) .cse1)))) (and .cse0 (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) .cse0 (fp.eq .cse1 .cse2)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2019-12-07 12:24:56,604 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (let ((.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or (fp.eq .cse1 c_ULTIMATE.start_main_~main__x1~0) .cse2 (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) .cse2 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2019-12-07 12:24:59,096 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (let ((.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or (fp.eq .cse1 c_ULTIMATE.start_main_~main__x1~0) .cse2 (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) .cse2 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2019-12-07 12:25:01,566 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode .cse0 .cse1)) .cse2 (= c_ULTIMATE.start_main_~main__x~0 .cse0) (or .cse2 (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2019-12-07 12:25:03,990 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode .cse0 .cse1)) .cse2 (= c_ULTIMATE.start_main_~main__x~0 .cse0) (or .cse2 (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2019-12-07 12:25:06,394 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse2))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse0)) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse1)) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse2) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode .cse0 .cse2)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2019-12-07 12:25:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:09,054 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-12-07 12:25:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:25:09,055 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 7 [2019-12-07 12:25:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:09,055 INFO L225 Difference]: With dead ends: 12 [2019-12-07 12:25:09,056 INFO L226 Difference]: Without dead ends: 9 [2019-12-07 12:25:09,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=42, Invalid=33, Unknown=23, NotChecked=322, Total=420 [2019-12-07 12:25:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-12-07 12:25:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-12-07 12:25:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 12:25:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-12-07 12:25:09,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-12-07 12:25:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:09,059 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-12-07 12:25:09,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:25:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-12-07 12:25:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:25:09,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:09,060 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-12-07 12:25:09,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,3 mathsat -unsat_core_generation=3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:09,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:25:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2019-12-07 12:25:09,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:25:09,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097814500] [2019-12-07 12:25:09,666 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:25:12,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:25:12,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:12,608 WARN L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:25:12,609 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:19,493 WARN L192 SmtUtils]: Spent 4.65 s on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 12:25:22,148 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:25:25,794 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:25:29,674 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 12:25:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:25:29,679 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:31,973 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2019-12-07 12:25:36,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 12:25:39,127 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 12:25:41,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 12:25:44,615 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 12:25:47,980 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 12:25:51,166 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 12:25:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:25:51,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097814500] [2019-12-07 12:25:51,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268852409] [2019-12-07 12:25:51,168 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:25:58,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:25:58,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:58,498 WARN L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:25:58,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:25:58,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:25:58,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104886946] [2019-12-07 12:25:58,511 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:16,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:26:16,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:26:16,881 WARN L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:26:16,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:22,080 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 12:26:24,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from false [2019-12-07 12:26:27,603 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from true [2019-12-07 12:26:30,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from false [2019-12-07 12:26:33,640 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from true [2019-12-07 12:26:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:26:33,646 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:36,139 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))) is different from false [2019-12-07 12:26:38,628 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))) is different from true [2019-12-07 12:26:41,370 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse2 c_ULTIMATE.start_main_~main__x1~0))))) is different from false [2019-12-07 12:26:44,101 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse2 c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2019-12-07 12:26:47,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse3) .cse0))))))) is different from false [2019-12-07 12:26:50,079 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse3))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse3))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse3) .cse0))))))) is different from true [2019-12-07 12:26:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-12-07 12:26:50,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:26:50,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 18 [2019-12-07 12:26:50,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129152642] [2019-12-07 12:26:50,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:26:50,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:26:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=25, Unknown=21, NotChecked=260, Total=342 [2019-12-07 12:26:50,082 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 19 states. [2019-12-07 12:26:53,089 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse5))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.div c_currentRoundingMode .cse1 .cse5))) (let ((.cse0 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse5) .cse4)))) (and (or .cse0 (fp.eq .cse1 .cse2) .cse3) (or .cse0 .cse3) (= c_currentRoundingMode roundNearestTiesToEven))))))) is different from true [2019-12-07 12:26:55,807 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (let ((.cse4 (fp.div c_currentRoundingMode .cse3 .cse0))) (let ((.cse1 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or .cse1 .cse2) (or .cse1 .cse2 (fp.eq .cse3 c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2019-12-07 12:26:58,670 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse0))) (let ((.cse4 (fp.div c_currentRoundingMode .cse3 .cse0))) (let ((.cse1 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse0) .cse4)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (or .cse1 .cse2) (or .cse1 .cse2 (fp.eq .cse3 c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2019-12-07 12:27:02,048 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4))) (.cse3 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode .cse0 .cse1)) (= c_ULTIMATE.start_main_~main__x~0 .cse0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse2 .cse3) (or .cse2 .cse3 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))))) is different from false [2019-12-07 12:27:04,535 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (.cse2 (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4))) (.cse3 (fp.eq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode .cse0 .cse1)) (= c_ULTIMATE.start_main_~main__x~0 .cse0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse2 .cse3) (or .cse2 .cse3 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))))) is different from true [2019-12-07 12:27:07,539 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from false [2019-12-07 12:27:10,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from true [2019-12-07 12:27:13,463 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (or (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from false [2019-12-07 12:27:15,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (and (= (fp.div c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_main_~main__x~0) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1) c_ULTIMATE.start_main_~main__x1~0) (or (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq .cse0 .cse2)))))) is different from true [2019-12-07 12:27:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:22,678 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-12-07 12:27:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:27:22,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 8 [2019-12-07 12:27:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:22,679 INFO L225 Difference]: With dead ends: 13 [2019-12-07 12:27:22,679 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 12:27:22,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 97.6s TimeCoverageRelationStatistics Valid=46, Invalid=26, Unknown=30, NotChecked=450, Total=552 [2019-12-07 12:27:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 12:27:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 12:27:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 12:27:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-12-07 12:27:22,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-12-07 12:27:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:22,682 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-12-07 12:27:22,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:27:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-12-07 12:27:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:27:22,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:22,683 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-12-07 12:27:23,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:23,285 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 3 times [2019-12-07 12:27:23,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:23,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338326091] [2019-12-07 12:27:23,287 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/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 [2019-12-07 12:27:27,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:27:27,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:27:27,735 WARN L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:27:27,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:30,207 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:27:32,821 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:27:35,261 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 12:27:38,181 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2019-12-07 12:27:41,123 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~main__x~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 12:27:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2019-12-07 12:27:41,128 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:43,424 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2019-12-07 12:27:45,682 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true [2019-12-07 12:27:48,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 12:27:50,681 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2019-12-07 12:27:53,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 12:27:56,202 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2019-12-07 12:27:59,531 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2019-12-07 12:28:01,575 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 12:28:01,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338326091] [2019-12-07 12:28:01,577 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 12:28:01,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [169327961] [2019-12-07 12:28:01,577 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:28:11,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:28:11,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:28:11,495 WARN L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:28:11,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:11,502 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@447693a5 [2019-12-07 12:28:11,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586307207] [2019-12-07 12:28:11,502 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8609f0da-e4eb-4ccb-ab39-7b8296a85379/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:28,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:35:28,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:35:30,017 WARN L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 12:35:30,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:35:30,020 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@447693a5 [2019-12-07 12:35:30,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:30,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 12:35:30,020 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 12:35:30,020 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:35:30,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:30,635 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 12:35:30,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:35:30 BoogieIcfgContainer [2019-12-07 12:35:30,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:35:30,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:35:30,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:35:30,636 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:35:30,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:15" (3/4) ... [2019-12-07 12:35:30,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:35:30,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:35:30,639 INFO L168 Benchmark]: Toolchain (without parser) took 859041.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 952.4 MB in the beginning and 908.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 144.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,640 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:35:30,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,641 INFO L168 Benchmark]: Boogie Preprocessor took 14.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,641 INFO L168 Benchmark]: RCFGBuilder took 3982.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,642 INFO L168 Benchmark]: TraceAbstraction took 854835.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 164.3 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:30,642 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.1 GB. Free memory is still 908.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:35:30,644 INFO L335 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.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 48.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3982.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 854835.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 164.3 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.1 GB. Free memory is still 908.2 MB. 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L1] int __return_main; [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 1.6; [L10] COND TRUE main__x1 != main__x [L12] main__x = main__x1 [L13] main__x1 = main__x / 1.6 [L10] COND TRUE main__x1 != main__x [L12] main__x = main__x1 [L13] main__x1 = main__x / 1.6 [L10] COND TRUE main__x1 != main__x [L12] main__x = main__x1 [L13] main__x1 = main__x / 1.6 [L10] COND TRUE main__x1 != main__x [L12] main__x = main__x1 [L13] main__x1 = main__x / 1.6 [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 [L23] COND TRUE __VERIFIER_assert__cond == 0 [L25] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Result: UNKNOWN, OverallTime: 854.7s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 65.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16 SDtfs, 8 SDslu, 26 SDs, 0 SdLazy, 18 SolverSat, 3 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 175.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 172.3s SatisfiabilityAnalysisTime, 128.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177 SizeOfPredicates, 38 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...