./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 ..................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:35:46,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:35:46,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:35:46,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:35:46,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:35:46,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:35:46,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:35:46,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:35:46,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:35:46,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:35:46,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:35:46,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:35:46,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:35:46,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:35:46,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:35:46,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:35:46,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:35:46,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:35:46,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:35:46,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:35:46,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:35:46,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:35:46,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:35:46,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:35:46,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:35:46,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:35:46,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:35:46,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:35:46,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:35:46,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:35:46,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:35:46,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:35:46,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:35:46,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:35:46,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:35:46,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:35:46,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:35:46,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:35:46,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:35:46,187 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:35:46,187 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:35:46,188 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:35:46,188 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:35:46,188 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:35:46,188 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:35:46,188 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:35:46,189 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:35:46,189 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:35:46,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:35:46,190 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:35:46,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:35:46,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:35:46,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:35:46,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:35:46,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:35:46,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:35:46,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:35:46,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:35:46,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:35:46,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:35:46,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:35:46,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:35:46,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:35:46,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:35:46,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:35:46,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:35:46,199 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-10-26 22:35:46,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:35:46,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:35:46,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:35:46,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:35:46,245 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:35:46,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:46,309 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/e35d77da8/ae6ec2c389864cc59ad244efbd4440da/FLAG3ca505b70 [2018-10-26 22:35:46,682 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:35:46,683 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:46,687 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/e35d77da8/ae6ec2c389864cc59ad244efbd4440da/FLAG3ca505b70 [2018-10-26 22:35:46,698 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/e35d77da8/ae6ec2c389864cc59ad244efbd4440da [2018-10-26 22:35:46,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:35:46,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:35:46,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:35:46,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:35:46,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:35:46,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352ae57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46, skipping insertion in model container [2018-10-26 22:35:46,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:35:46,733 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:35:46,849 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:35:46,854 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:35:46,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:35:46,879 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:35:46,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46 WrapperNode [2018-10-26 22:35:46,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:35:46,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:35:46,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:35:46,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:35:46,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:35:46,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:35:46,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:35:46,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:35:46,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... [2018-10-26 22:35:46,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:35:46,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:35:46,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:35:46,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:35:46,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:35:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:35:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:35:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:35:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:35:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:35:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:35:47,214 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:35:47,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:35:47 BoogieIcfgContainer [2018-10-26 22:35:47,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:35:47,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:35:47,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:35:47,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:35:47,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:35:46" (1/3) ... [2018-10-26 22:35:47,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea4f1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:35:47, skipping insertion in model container [2018-10-26 22:35:47,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:46" (2/3) ... [2018-10-26 22:35:47,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea4f1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:35:47, skipping insertion in model container [2018-10-26 22:35:47,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:35:47" (3/3) ... [2018-10-26 22:35:47,221 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:47,230 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:35:47,238 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:35:47,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:35:47,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:35:47,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:35:47,281 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:35:47,281 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:35:47,281 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:35:47,281 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:35:47,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:35:47,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:35:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-26 22:35:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:35:47,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:47,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:47,308 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:47,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-10-26 22:35:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:35:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:35:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:47,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:35:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:35:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:35:47,409 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:35:47,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:35:47 BoogieIcfgContainer [2018-10-26 22:35:47,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:35:47,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:35:47,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:35:47,434 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:35:47,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:35:47" (3/4) ... [2018-10-26 22:35:47,438 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 22:35:47,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:35:47,439 INFO L168 Benchmark]: Toolchain (without parser) took 737.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:35:47,441 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:35:47,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 945.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:47,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.47 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:35:47,443 INFO L168 Benchmark]: Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:47,443 INFO L168 Benchmark]: RCFGBuilder took 297.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:47,446 INFO L168 Benchmark]: TraceAbstraction took 218.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:47,446 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:35:47,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 945.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.47 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 218.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:35:49,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:35:49,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:35:49,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:35:49,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:35:49,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:35:49,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:35:49,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:35:49,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:35:49,511 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:35:49,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:35:49,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:35:49,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:35:49,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:35:49,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:35:49,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:35:49,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:35:49,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:35:49,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:35:49,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:35:49,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:35:49,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:35:49,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:35:49,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:35:49,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:35:49,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:35:49,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:35:49,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:35:49,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:35:49,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:35:49,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:35:49,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:35:49,540 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:35:49,540 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:35:49,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:35:49,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:35:49,542 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 22:35:49,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:35:49,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:35:49,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:35:49,554 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:35:49,554 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:35:49,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:35:49,554 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:35:49,555 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:35:49,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:35:49,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:35:49,556 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:35:49,557 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:35:49,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:35:49,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:35:49,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:35:49,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:35:49,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:35:49,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 22:35:49,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:35:49,559 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:35:49,559 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:35:49,559 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-10-26 22:35:49,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:35:49,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:35:49,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:35:49,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:35:49,614 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:35:49,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:49,664 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/5f6538e4d/008e813e5faf4ea8bff0d21ab430138a/FLAG0c40d5a81 [2018-10-26 22:35:50,037 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:35:50,038 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:50,042 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/5f6538e4d/008e813e5faf4ea8bff0d21ab430138a/FLAG0c40d5a81 [2018-10-26 22:35:50,053 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/data/5f6538e4d/008e813e5faf4ea8bff0d21ab430138a [2018-10-26 22:35:50,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:35:50,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:35:50,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:35:50,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:35:50,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:35:50,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6742537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50, skipping insertion in model container [2018-10-26 22:35:50,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:35:50,092 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:35:50,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:35:50,279 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:35:50,294 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:35:50,308 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:35:50,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50 WrapperNode [2018-10-26 22:35:50,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:35:50,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:35:50,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:35:50,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:35:50,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:35:50,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:35:50,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:35:50,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:35:50,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... [2018-10-26 22:35:50,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:35:50,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:35:50,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:35:50,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:35:50,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:35:50,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:35:50,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:35:50,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:35:50,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:35:50,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:35:50,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:35:52,916 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:35:52,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:35:52 BoogieIcfgContainer [2018-10-26 22:35:52,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:35:52,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:35:52,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:35:52,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:35:52,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:35:50" (1/3) ... [2018-10-26 22:35:52,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60537854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:35:52, skipping insertion in model container [2018-10-26 22:35:52,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:35:50" (2/3) ... [2018-10-26 22:35:52,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60537854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:35:52, skipping insertion in model container [2018-10-26 22:35:52,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:35:52" (3/3) ... [2018-10-26 22:35:52,924 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-10-26 22:35:52,943 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:35:52,953 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:35:52,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:35:53,004 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:35:53,005 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:35:53,005 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:35:53,005 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:35:53,006 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:35:53,006 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:35:53,006 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:35:53,006 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:35:53,007 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:35:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-26 22:35:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:35:53,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:53,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:53,029 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:53,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-10-26 22:35:53,039 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:35:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-10-26 22:35:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:35:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:53,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:59,575 WARN L179 SmtUtils]: Spent 4.98 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 22:35:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:59,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:35:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:35:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:35:59,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:35:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:35:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:35:59,614 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-26 22:36:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:36:04,167 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-10-26 22:36:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:36:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-26 22:36:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:36:04,412 INFO L225 Difference]: With dead ends: 22 [2018-10-26 22:36:04,413 INFO L226 Difference]: Without dead ends: 11 [2018-10-26 22:36:04,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:36:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-26 22:36:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-26 22:36:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-26 22:36:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-26 22:36:04,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-26 22:36:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:36:04,455 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-26 22:36:04,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:36:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-26 22:36:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 22:36:04,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:36:04,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:36:04,456 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:36:04,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:36:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-10-26 22:36:04,458 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:36:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-10-26 22:36:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:36:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:36:04,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:36:07,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:36:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 22:36:07,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:36:09,456 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-10-26 22:36:11,686 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-10-26 22:36:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 22:36:11,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:36:11,745 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:36:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:36:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-10-26 22:36:24,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:36:24,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-26 22:36:24,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:36:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:36:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2018-10-26 22:36:24,288 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-26 22:36:26,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:36:28,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:36:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:36:33,349 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-26 22:36:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:36:33,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-26 22:36:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:36:33,351 INFO L225 Difference]: With dead ends: 15 [2018-10-26 22:36:33,351 INFO L226 Difference]: Without dead ends: 12 [2018-10-26 22:36:33,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2018-10-26 22:36:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-26 22:36:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-26 22:36:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-26 22:36:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-26 22:36:33,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-26 22:36:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:36:33,358 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-26 22:36:33,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:36:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-26 22:36:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 22:36:33,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:36:33,359 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:36:33,359 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:36:33,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:36:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-10-26 22:36:33,360 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:36:33,360 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-10-26 22:36:33,379 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-10-26 22:36:34,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:36:34,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:36:34,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:36:36,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:36:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-26 22:36:36,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:36:38,745 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-10-26 22:36:42,407 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:36:44,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:36:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-10-26 22:36:44,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:36:44,935 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:36:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:36:58,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:36:58,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 22:36:59,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:36:59,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-26 22:36:59,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:36:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:36:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=30, Total=72 [2018-10-26 22:36:59,361 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-10-26 22:37:01,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2)))) (or (fp.eq .cse0 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse2)) .cse0)))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-10-26 22:37:04,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:37:06,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:37:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:37:08,449 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-26 22:37:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:37:08,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-26 22:37:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:37:08,451 INFO L225 Difference]: With dead ends: 16 [2018-10-26 22:37:08,451 INFO L226 Difference]: Without dead ends: 13 [2018-10-26 22:37:08,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=21, Invalid=26, Unknown=7, NotChecked=78, Total=132 [2018-10-26 22:37:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-26 22:37:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-26 22:37:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-26 22:37:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-26 22:37:08,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-26 22:37:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:37:08,458 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-26 22:37:08,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:37:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-26 22:37:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 22:37:08,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:37:08,459 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:37:08,459 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:37:08,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:37:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-10-26 22:37:08,459 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:37:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-10-26 22:37:08,465 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 22:37:09,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:37:09,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:37:09,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:37:12,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:37:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-10-26 22:37:12,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:37:14,488 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-10-26 22:37:16,716 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from true [2018-10-26 22:37:19,143 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:37:21,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:37:24,196 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-10-26 22:37:26,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:37:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-10-26 22:37:26,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:37:26,873 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:37:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:37:52,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:37:52,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 22:37:53,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:37:53,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-10-26 22:37:53,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:37:53,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:37:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=32, Unknown=7, NotChecked=52, Total=110 [2018-10-26 22:37:53,405 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-10-26 22:37:56,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse0)) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2))) .cse2)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse2)) .cse1)) (fp.eq .cse1 .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-10-26 22:37:58,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:38:00,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:38:03,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:38:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:38:09,376 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-26 22:38:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:38:09,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-10-26 22:38:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:38:09,378 INFO L225 Difference]: With dead ends: 17 [2018-10-26 22:38:09,379 INFO L226 Difference]: Without dead ends: 14 [2018-10-26 22:38:09,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=27, Invalid=36, Unknown=11, NotChecked=136, Total=210 [2018-10-26 22:38:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-26 22:38:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-26 22:38:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-26 22:38:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-26 22:38:09,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-26 22:38:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:38:09,387 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-26 22:38:09,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:38:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-26 22:38:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:38:09,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:38:09,388 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:38:09,388 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:38:09,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:38:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-10-26 22:38:09,389 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:38:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-10-26 22:38:09,394 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:38:10,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:38:10,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:38:10,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:38:13,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:38:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-10-26 22:38:13,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:38:15,390 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-10-26 22:38:17,619 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-10-26 22:38:20,074 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:38:22,533 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:38:25,226 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:38:27,909 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:38:30,779 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:38:33,633 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:38:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-10-26 22:38:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:38:33,670 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:38:33,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:38:57,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:38:57,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 22:38:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:38:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-26 22:38:58,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 22:38:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 22:38:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=32, Unknown=9, NotChecked=70, Total=132 [2018-10-26 22:38:58,831 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-10-26 22:39:01,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:39:04,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:39:06,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:39:09,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-10-26 22:39:11,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:39:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:39:16,768 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-26 22:39:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:39:16,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-10-26 22:39:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:39:16,769 INFO L225 Difference]: With dead ends: 18 [2018-10-26 22:39:16,770 INFO L226 Difference]: Without dead ends: 15 [2018-10-26 22:39:16,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=31, Invalid=37, Unknown=14, NotChecked=190, Total=272 [2018-10-26 22:39:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-26 22:39:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-26 22:39:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-26 22:39:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-26 22:39:16,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-26 22:39:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:39:16,778 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-26 22:39:16,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 22:39:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-26 22:39:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 22:39:16,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:39:16,779 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:39:16,780 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:39:16,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:39:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-10-26 22:39:16,780 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:39:16,780 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-10-26 22:39:16,786 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-10-26 22:39:18,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-26 22:39:18,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:39:18,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:39:20,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:39:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-10-26 22:39:20,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:39:23,014 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-10-26 22:39:25,242 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-10-26 22:39:27,703 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:39:30,172 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:39:32,857 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:39:35,547 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:39:38,440 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:39:41,365 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:39:44,461 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:39:47,543 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:39:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-10-26 22:39:47,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:39:47,593 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:39:47,600 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:40:31,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-26 22:40:31,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Forcibly destroying the process [2018-10-26 22:40:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:40:32,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-26 22:40:32,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:40:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:40:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=44, Unknown=11, NotChecked=102, Total=182 [2018-10-26 22:40:32,818 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-10-26 22:40:35,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:40:38,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:40:41,647 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:40:44,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:40:46,360 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:40:48,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:40:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:57,194 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-26 22:40:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:40:57,195 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-26 22:40:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:57,195 INFO L225 Difference]: With dead ends: 19 [2018-10-26 22:40:57,196 INFO L226 Difference]: Without dead ends: 16 [2018-10-26 22:40:57,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=37, Invalid=50, Unknown=17, NotChecked=276, Total=380 [2018-10-26 22:40:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-26 22:40:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-26 22:40:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-26 22:40:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-26 22:40:57,203 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-26 22:40:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:57,204 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-26 22:40:57,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:40:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-26 22:40:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:40:57,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:57,205 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:57,205 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:57,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-10-26 22:40:57,206 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:40:57,206 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-10-26 22:40:57,222 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-10-26 22:40:58,993 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-26 22:40:58,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:59,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:41:01,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:41:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-10-26 22:41:01,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:41:37,372 WARN L179 SmtUtils]: Spent 11.38 s on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 22:41:39,838 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:41:42,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:41:44,995 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-10-26 22:41:47,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:41:50,611 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:41:53,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:41:56,648 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:41:59,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:42:03,361 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:42:06,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:42:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2018-10-26 22:42:06,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:42:06,763 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:42:06,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:42:44,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-26 22:42:44,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Forcibly destroying the process [2018-10-26 22:42:46,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:42:46,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-10-26 22:42:46,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:42:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:42:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=77, Unknown=20, NotChecked=138, Total=272 [2018-10-26 22:42:46,037 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-10-26 22:42:49,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (fp.eq .cse0 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse2)) .cse0)))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-10-26 22:42:52,729 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE (/ 5.0 2.0))) (.cse1 ((_ to_fp 8 24) RNE (_ bv0 32)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2)))) (or (fp.eq .cse0 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse2)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2))) .cse2)) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)))) is different from true [2018-10-26 22:42:55,738 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 22:42:58,440 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-10-26 22:43:00,931 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:43:05,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-10-26 22:43:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:43:09,931 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-26 22:43:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:43:09,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-26 22:43:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:43:09,933 INFO L225 Difference]: With dead ends: 20 [2018-10-26 22:43:09,933 INFO L226 Difference]: Without dead ends: 17 [2018-10-26 22:43:09,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.9s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=26, NotChecked=348, Total=506 [2018-10-26 22:43:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-26 22:43:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-26 22:43:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-26 22:43:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-26 22:43:09,941 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-26 22:43:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:43:09,941 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-26 22:43:09,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:43:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-26 22:43:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 22:43:09,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:43:09,944 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:43:09,944 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:43:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:43:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-10-26 22:43:09,945 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:43:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-10-26 22:43:09,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:43:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:11,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:43:14,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:43:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-10-26 22:43:14,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:43:16,528 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-10-26 22:43:18,786 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-10-26 22:43:21,268 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:23,772 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:26,546 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:29,264 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:32,209 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:35,170 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:38,362 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:41,544 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:44,889 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:48,418 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:52,104 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from false [2018-10-26 22:43:55,685 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) is different from true [2018-10-26 22:43:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2018-10-26 22:43:55,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:43:55,742 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:43:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:44:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Forcibly destroying the process [2018-10-26 22:44:09,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:44:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-26 22:44:09,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:44:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:44:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=15, NotChecked=184, Total=306 [2018-10-26 22:44:09,435 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 18 states. [2018-10-26 22:44:12,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:44:16,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:44:19,483 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:44:22,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:44:25,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:44:27,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1))))) is different from true [2018-10-26 22:44:29,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-10-26 22:44:32,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:44:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:44:39,994 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-26 22:44:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:44:39,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-10-26 22:44:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:44:39,996 INFO L225 Difference]: With dead ends: 21 [2018-10-26 22:44:39,996 INFO L226 Difference]: Without dead ends: 18 [2018-10-26 22:44:39,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=49, Invalid=82, Unknown=23, NotChecked=496, Total=650 [2018-10-26 22:44:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-26 22:44:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-26 22:44:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-26 22:44:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-26 22:44:40,006 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-26 22:44:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:44:40,007 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-26 22:44:40,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 22:44:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-26 22:44:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 22:44:40,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:44:40,007 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:44:40,008 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:44:40,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:44:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2018-10-26 22:44:40,011 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:44:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-10-26 22:44:40,019 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:44:42,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:44:42,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:44:42,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:44:44,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:44:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-10-26 22:44:44,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:44:46,944 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-10-26 22:44:50,536 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:44:53,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:44:55,747 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-10-26 22:44:58,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:45:01,461 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:45:04,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:45:07,629 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:45:10,840 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:45:14,272 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:45:17,647 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:45:21,090 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-10-26 22:45:24,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:45:27,981 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from false [2018-10-26 22:45:31,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0))))) is different from true [2018-10-26 22:45:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-10-26 22:45:31,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:45:31,686 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:45:31,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:45:45,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:45:45,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Forcibly destroying the process [2018-10-26 22:45:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:45:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-10-26 22:45:47,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:45:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:45:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=113, Unknown=16, NotChecked=252, Total=420 [2018-10-26 22:45:47,328 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-10-26 22:45:50,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (fp.eq .cse0 .cse1) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse2)) .cse0)))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-10-26 22:45:54,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-10-26 22:45:57,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:46:01,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-10-26 22:46:04,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 22:46:06,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-10-26 22:46:09,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse1) .cse0)) .cse1)))))) is different from true [2018-10-26 22:46:11,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-10-26 22:46:13,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (and (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (= c_main_~main__x~0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) .cse0)) c_main_~main__x1~0))) is different from true [2018-10-26 22:46:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:46:21,982 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-26 22:46:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:46:21,983 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-10-26 22:46:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:46:21,984 INFO L225 Difference]: With dead ends: 22 [2018-10-26 22:46:21,984 INFO L226 Difference]: Without dead ends: 19 [2018-10-26 22:46:21,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.0s TimeCoverageRelationStatistics Valid=57, Invalid=122, Unknown=25, NotChecked=666, Total=870 [2018-10-26 22:46:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-26 22:46:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-26 22:46:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-26 22:46:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-26 22:46:21,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-26 22:46:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:46:21,993 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-26 22:46:21,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:46:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-26 22:46:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 22:46:21,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:46:21,993 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:46:21,994 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:46:21,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:46:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1545361012, now seen corresponding path program 9 times [2018-10-26 22:46:21,994 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:46:21,994 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db5f78d1-b873-42e6-a428-1de1f039b321/bin-2019/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-10-26 22:46:22,002 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 22:46:23,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:46:23,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:46:23,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:46:25,701 WARN L832 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0) is different from false [2018-10-26 22:46:27,934 WARN L854 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0) is different from true [2018-10-26 22:46:30,421 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_main_~main__x~0_49 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE v_main_~main__x~0_49) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))))) (and (= c_main_~main__x~0 .cse0) (not (fp.eq .cse0 v_main_~main__x~0_49))))) (= ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-10-26 22:46:44,690 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE v_prenex_2) .cse1)))) (and (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) (= c_main_~__VERIFIER_assert__cond~0 (_ bv0 32))) (and (= (bvadd c_main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_main_~main__x~0_49 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE v_main_~main__x~0_49) .cse3)))) (and (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse2) .cse3)) .cse2) (not (fp.eq .cse2 v_main_~main__x~0_49)) (fp.eq .cse2 ((_ to_fp 8 24) RNE (_ bv0 32))))))))) is different from false [2018-10-26 22:46:52,212 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE v_prenex_2) .cse1)))) (and (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-10-26 22:46:54,666 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE v_prenex_2) .cse1)))) (and (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE .cse0) .cse1)) .cse0) (not (fp.eq .cse0 v_prenex_2)) (not (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from true [2018-10-26 22:46:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 1 not checked. [2018-10-26 22:46:54,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:46:56,959 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 c_main_~main__x~0) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from false [2018-10-26 22:46:59,218 WARN L854 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 c_main_~main__x~0) (not (fp.eq ((_ to_fp 8 24) RNE (fp.div RNE ((_ to_fp 11 53) RNE c_main_~main__x1~0) ((_ to_fp 11 53) RNE (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) is different from true [2018-10-26 22:47:04,688 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-10-26 22:47:04,889 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2018-10-26 22:47:04,889 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-10-26 22:47:04,893 INFO L168 Benchmark]: Toolchain (without parser) took 674836.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 953.2 MB in the beginning and 1.2 GB in the end (delta: -201.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:47:04,893 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:47:04,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:47:04,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:47:04,894 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:47:04,895 INFO L168 Benchmark]: RCFGBuilder took 2565.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 937.1 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:47:04,895 INFO L168 Benchmark]: TraceAbstraction took 671974.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 45.6 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:47:04,909 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 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 21.24 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2565.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 937.1 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 671974.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 45.6 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...