./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.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_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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 b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 ......................................................................................................................................................................................................................................................................................... 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_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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 b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:13:38,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:13:38,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:13:38,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:13:38,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:13:38,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:13:38,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:13:38,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:13:38,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:13:38,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:13:38,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:13:38,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:13:38,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:13:38,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:13:38,435 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:13:38,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:13:38,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:13:38,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:13:38,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:13:38,444 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:13:38,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:13:38,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:13:38,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:13:38,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:13:38,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:13:38,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:13:38,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:13:38,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:13:38,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:13:38,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:13:38,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:13:38,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:13:38,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:13:38,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:13:38,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:13:38,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:13:38,465 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:13:38,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:13:38,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:13:38,477 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:13:38,477 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:13:38,478 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:13:38,478 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:13:38,478 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:13:38,478 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:13:38,478 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:13:38,478 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:13:38,479 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:13:38,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:13:38,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:13:38,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:13:38,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:13:38,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:13:38,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:13:38,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:13:38,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:13:38,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:13:38,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:13:38,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:13:38,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:13:38,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:13:38,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:13:38,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:13:38,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:13:38,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:13:38,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:13:38,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:13:38,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:13:38,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:13:38,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:13:38,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:13:38,485 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_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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 -> b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 [2018-10-26 22:13:38,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:13:38,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:13:38,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:13:38,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:13:38,536 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:13:38,537 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:38,604 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/6988c228a/bda617f0e2b842e9bc4045d6d85487ec/FLAGcea729e89 [2018-10-26 22:13:38,981 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:13:38,982 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:38,988 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/6988c228a/bda617f0e2b842e9bc4045d6d85487ec/FLAGcea729e89 [2018-10-26 22:13:39,000 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/6988c228a/bda617f0e2b842e9bc4045d6d85487ec [2018-10-26 22:13:39,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:13:39,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:13:39,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:39,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:13:39,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:13:39,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf504d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39, skipping insertion in model container [2018-10-26 22:13:39,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:13:39,056 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:13:39,203 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:39,206 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:13:39,225 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:39,239 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:13:39,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39 WrapperNode [2018-10-26 22:13:39,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:39,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:39,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:13:39,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:13:39,250 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:13:39" (1/1) ... [2018-10-26 22:13:39,256 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:13:39" (1/1) ... [2018-10-26 22:13:39,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:39,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:13:39,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:13:39,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:13:39,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... [2018-10-26 22:13:39,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:13:39,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:13:39,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:13:39,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:13:39,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:13:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:13:39,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:13:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2018-10-26 22:13:39,391 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2018-10-26 22:13:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-10-26 22:13:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-10-26 22:13:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure bary [2018-10-26 22:13:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure bary [2018-10-26 22:13:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:13:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:13:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:13:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:13:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 22:13:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 22:13:39,921 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:13:39,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:39 BoogieIcfgContainer [2018-10-26 22:13:39,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:13:39,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:13:39,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:13:39,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:13:39,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:13:39" (1/3) ... [2018-10-26 22:13:39,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b68de72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:39, skipping insertion in model container [2018-10-26 22:13:39,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:39" (2/3) ... [2018-10-26 22:13:39,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b68de72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:39, skipping insertion in model container [2018-10-26 22:13:39,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:39" (3/3) ... [2018-10-26 22:13:39,931 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:39,942 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:13:39,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:13:39,966 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:13:39,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:13:39,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:13:39,999 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:13:39,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:13:39,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:13:39,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:13:39,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:13:39,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:13:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-26 22:13:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:13:40,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:40,025 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:40,027 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:40,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:40,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1528355945, now seen corresponding path program 1 times [2018-10-26 22:13:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:40,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:13:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:13:40,230 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:13:40,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:13:40 BoogieIcfgContainer [2018-10-26 22:13:40,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:13:40,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:13:40,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:13:40,281 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:13:40,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:39" (3/4) ... [2018-10-26 22:13:40,286 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 22:13:40,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:13:40,287 INFO L168 Benchmark]: Toolchain (without parser) took 1283.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:13:40,289 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:13:40,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:40,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.38 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:13:40,291 INFO L168 Benchmark]: Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 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:13:40,293 INFO L168 Benchmark]: RCFGBuilder took 643.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:40,294 INFO L168 Benchmark]: TraceAbstraction took 357.25 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:40,295 INFO L168 Benchmark]: Witness Printer took 6.14 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:13:40,299 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.38 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 643.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 357.25 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.14 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: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 31. Possible FailurePath: [L15] float C1, I; [L14] BOOLEAN INIT; [L29] static float X,Y,Z; VAL [\old(C1)=7, \old(I)=9, \old(INIT)=2, \old(X)=4, \old(Y)=5, \old(Z)=8, C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L50] int i; [L52] INIT = TRUE VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L53] CALL, EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] RET return x; VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, \result=3, C1=0, I=0, INIT=1, x=3, X=0, Y=0, Z=0] [L53] EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=0, I=0, INIT=1, RANDOM_INPUT()=3, X=0, Y=0, Z=0] [L53] C1 = RANDOM_INPUT() [L54] CALL, EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=0, INIT=1, X=0, Y=0, Z=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] RET return x; VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, \result=6, C1=3, I=0, INIT=1, x=6, X=0, Y=0, Z=0] [L54] EXPR RANDOM_INPUT() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=0, INIT=1, RANDOM_INPUT()=6, X=0, Y=0, Z=0] [L54] I = RANDOM_INPUT() [L56] i = 0 VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, i=0, I=6, INIT=1, X=0, Y=0, Z=0] [L56] COND TRUE i < 3600000 VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, i=0, I=6, INIT=1, X=0, Y=0, Z=0] [L57] CALL bary() VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=0, Y=0, Z=0] [L31] COND TRUE C1 > 0.f [L32] Z = Y [L33] Y = X VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=0, Y=0, Z=0] [L36] COND TRUE INIT == TRUE [L37] X = I [L38] Y = I [L39] Z = I VAL [\old(C1)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=6, Y=6, Z=6] [L45] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, I=6, INIT=1, X=6, Y=6, Z=6] [L9] COND TRUE !(cond) VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, cond=0, I=6, INIT=1, X=6, Y=6, Z=6] [L9] __VERIFIER_error() VAL [\old(C1)=0, \old(cond)=0, \old(I)=0, \old(INIT)=0, \old(X)=0, \old(Y)=0, \old(Z)=0, C1=3, cond=0, I=6, INIT=1, X=6, Y=6, Z=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 25 NumberOfCodeBlocks, 25 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:13:42,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:13:42,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:13:42,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:13:42,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:13:42,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:13:42,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:13:42,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:13:42,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:13:42,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:13:42,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:13:42,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:13:42,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:13:42,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:13:42,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:13:42,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:13:42,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:13:42,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:13:42,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:13:42,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:13:42,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:13:42,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:13:42,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:13:42,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:13:42,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:13:42,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:13:42,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:13:42,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:13:42,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:13:42,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:13:42,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:13:42,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:13:42,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:13:42,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:13:42,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:13:42,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:13:42,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 22:13:42,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:13:42,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:13:42,457 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:13:42,457 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:13:42,457 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:13:42,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:13:42,458 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:13:42,458 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:13:42,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:13:42,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:13:42,459 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:13:42,460 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:13:42,460 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:13:42,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:13:42,462 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:13:42,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:13:42,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:13:42,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:13:42,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:13:42,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:13:42,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:13:42,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:13:42,463 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:13:42,464 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 22:13:42,464 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:13:42,464 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:13:42,464 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:13:42,464 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_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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 -> b00bb4cbbb267b3a6dbfbb1f9808dfa82de7ed74 [2018-10-26 22:13:42,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:13:42,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:13:42,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:13:42,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:13:42,520 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:13:42,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:42,568 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/9190f1a9d/8345bfcd9a6f47d5b7c0cce4a99f94a4/FLAGcfc00abfd [2018-10-26 22:13:42,909 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:13:42,910 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/sv-benchmarks/c/float-benchs/bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:42,917 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/9190f1a9d/8345bfcd9a6f47d5b7c0cce4a99f94a4/FLAGcfc00abfd [2018-10-26 22:13:42,931 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/data/9190f1a9d/8345bfcd9a6f47d5b7c0cce4a99f94a4 [2018-10-26 22:13:42,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:13:42,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:13:42,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:42,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:13:42,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:13:42,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:42" (1/1) ... [2018-10-26 22:13:42,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641b4f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:42, skipping insertion in model container [2018-10-26 22:13:42,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:42" (1/1) ... [2018-10-26 22:13:42,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:13:42,976 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:13:43,146 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:43,155 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:13:43,178 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:43,196 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:13:43,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43 WrapperNode [2018-10-26 22:13:43,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:43,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:43,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:13:43,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:13:43,207 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:13:43" (1/1) ... [2018-10-26 22:13:43,217 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:13:43" (1/1) ... [2018-10-26 22:13:43,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:43,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:13:43,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:13:43,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:13:43,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... [2018-10-26 22:13:43,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:13:43,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:13:43,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:13:43,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:13:43,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:13:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:13:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:13:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_clock [2018-10-26 22:13:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_clock [2018-10-26 22:13:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-10-26 22:13:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-10-26 22:13:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure bary [2018-10-26 22:13:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure bary [2018-10-26 22:13:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:13:43,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:13:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:13:43,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:13:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 22:13:43,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 22:13:44,350 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:13:44,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:44 BoogieIcfgContainer [2018-10-26 22:13:44,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:13:44,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:13:44,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:13:44,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:13:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:13:42" (1/3) ... [2018-10-26 22:13:44,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e978e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:44, skipping insertion in model container [2018-10-26 22:13:44,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:43" (2/3) ... [2018-10-26 22:13:44,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e978e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:44, skipping insertion in model container [2018-10-26 22:13:44,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:44" (3/3) ... [2018-10-26 22:13:44,360 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge_true-unreach-call_true-termination.c [2018-10-26 22:13:44,368 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:13:44,375 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:13:44,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:13:44,415 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:13:44,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:13:44,416 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:13:44,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:13:44,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:13:44,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:13:44,417 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:13:44,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:13:44,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:13:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-26 22:13:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:13:44,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:44,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:44,445 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:44,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1528355945, now seen corresponding path program 1 times [2018-10-26 22:13:44,453 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:13:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:13:44,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:44,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:44,872 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:13:44,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:44,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 22:13:44,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:13:44,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:13:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:13:44,914 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 8 states. [2018-10-26 22:13:47,606 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:13:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:47,929 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-10-26 22:13:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:13:47,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-26 22:13:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:47,941 INFO L225 Difference]: With dead ends: 123 [2018-10-26 22:13:47,941 INFO L226 Difference]: Without dead ends: 76 [2018-10-26 22:13:47,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:13:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-26 22:13:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-10-26 22:13:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 22:13:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-10-26 22:13:47,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 25 [2018-10-26 22:13:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:47,992 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-10-26 22:13:47,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:13:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-10-26 22:13:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:13:47,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:47,994 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:47,994 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:47,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1530202987, now seen corresponding path program 1 times [2018-10-26 22:13:47,995 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:13:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:13:48,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:48,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:48,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:13:48,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:48,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:13:48,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:13:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:13:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:13:48,266 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2018-10-26 22:13:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:50,295 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-10-26 22:13:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:13:50,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 22:13:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:50,316 INFO L225 Difference]: With dead ends: 101 [2018-10-26 22:13:50,316 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 22:13:50,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:13:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 22:13:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-26 22:13:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-26 22:13:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-10-26 22:13:50,335 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2018-10-26 22:13:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:50,336 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-10-26 22:13:50,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:13:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-10-26 22:13:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:13:50,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:50,338 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:50,338 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:50,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash 97872375, now seen corresponding path program 1 times [2018-10-26 22:13:50,340 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:13:50,340 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-10-26 22:13:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:50,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:13:50,854 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:13:50,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:50,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 22:13:50,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:13:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:13:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:13:50,870 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 8 states. [2018-10-26 22:13:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:55,603 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-10-26 22:13:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:13:55,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-10-26 22:13:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:55,606 INFO L225 Difference]: With dead ends: 94 [2018-10-26 22:13:55,606 INFO L226 Difference]: Without dead ends: 92 [2018-10-26 22:13:55,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:13:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-26 22:13:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2018-10-26 22:13:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-26 22:13:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-10-26 22:13:55,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-10-26 22:13:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:55,626 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-10-26 22:13:55,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:13:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-10-26 22:13:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:13:55,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:55,629 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:55,629 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:55,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 99719417, now seen corresponding path program 1 times [2018-10-26 22:13:55,630 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:13:55,630 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-10-26 22:13:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:55,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:58,647 WARN L854 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-10-26 22:14:12,348 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 (fp.neg .cse2)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0)))))) .cse1))) is different from false [2018-10-26 22:14:22,500 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse2) (fp.geq ~Y~0 (fp.neg .cse2))))) .cse0))) is different from false [2018-10-26 22:14:32,616 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from false [2018-10-26 22:14:34,637 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq v_prenex_2 .cse1) (fp.geq v_prenex_2 (fp.neg .cse1)) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_2) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_2)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_2)) ((_ to_fp 8 24) RNE 5.0))))))) is different from true [2018-10-26 22:14:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2018-10-26 22:14:34,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:36,815 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-10-26 22:14:40,202 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-10-26 22:14:43,502 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-10-26 22:14:47,205 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-10-26 22:14:49,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-10-26 22:14:51,280 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 5.0)) (.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 c_~Y~0))) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~I~0) (fp.mul RNE .cse9 c_~I~0)) (fp.mul RNE .cse10 c_~I~0))) (.cse7 (fp.neg .cse5))) (let ((.cse1 (fp.geq .cse4 .cse7)) (.cse3 (fp.leq .cse6 .cse5)) (.cse2 (fp.geq .cse6 .cse7)) (.cse0 (fp.leq .cse4 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (not .cse1) (and .cse3 .cse2) (not .cse0))))) is different from false [2018-10-26 22:15:32,065 WARN L179 SmtUtils]: Spent 11.24 s on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:15:44,249 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from false [2018-10-26 22:15:46,283 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_3 .cse0)) (not (fp.geq v_prenex_3 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_3) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_3)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_3)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_RANDOM_INPUT_~x~0_14 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_14 .cse1)) (not (fp.geq v_RANDOM_INPUT_~x~0_14 (fp.neg .cse1))) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_14)) ((_ to_fp 8 24) RNE 5.0)))))) is different from true [2018-10-26 22:15:46,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:15:46,295 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:15:46,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:15:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-10-26 22:15:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:15:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-26 22:15:58,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 22:15:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 22:15:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=104, Unknown=19, NotChecked=252, Total=420 [2018-10-26 22:15:58,444 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 12 states. [2018-10-26 22:16:00,503 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-26 22:16:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:16:12,353 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-10-26 22:16:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 22:16:12,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-10-26 22:16:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:16:12,374 INFO L225 Difference]: With dead ends: 96 [2018-10-26 22:16:12,374 INFO L226 Difference]: Without dead ends: 94 [2018-10-26 22:16:12,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=79, Invalid=177, Unknown=20, NotChecked=324, Total=600 [2018-10-26 22:16:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-26 22:16:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-10-26 22:16:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-26 22:16:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-10-26 22:16:12,393 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 56 [2018-10-26 22:16:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:16:12,393 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2018-10-26 22:16:12,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 22:16:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2018-10-26 22:16:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 22:16:12,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:16:12,395 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:16:12,395 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:16:12,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:16:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash 564582827, now seen corresponding path program 2 times [2018-10-26 22:16:12,397 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:16:12,397 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:16:12,401 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:16:12,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:16:12,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:16:12,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:16:15,069 WARN L832 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from false [2018-10-26 22:16:17,084 WARN L854 $PredicateComparison]: unable to prove that (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0)) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)))))) is different from true [2018-10-26 22:16:30,418 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-10-26 22:16:40,557 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) .cse1) (and .cse1 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 (fp.neg .cse2)))))))) is different from false [2018-10-26 22:16:50,670 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from false [2018-10-26 22:16:52,691 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse0) (fp.geq ~Y~0 (fp.neg .cse0))))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse1) (fp.geq v_prenex_5 (fp.neg .cse1)))))) is different from true [2018-10-26 22:16:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2018-10-26 22:16:52,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:16:54,816 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-10-26 22:16:57,754 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-10-26 22:16:59,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-10-26 22:17:01,884 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-10-26 22:17:05,293 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from false [2018-10-26 22:17:07,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.neg .cse3)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~I~0) (fp.mul RNE .cse5 c_~I~0)) (fp.mul RNE .cse6 c_~I~0)))) (or (not (fp.geq .cse0 .cse1)) (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse4 c_~X~0) (fp.mul RNE .cse5 c_~X~0)) (fp.mul RNE .cse6 c_~Y~0)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1))) (not (fp.leq .cse0 .cse3))))) is different from true [2018-10-26 22:17:09,380 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 5.0)) (.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 c_~Y~0))) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~I~0) (fp.mul RNE .cse9 c_~I~0)) (fp.mul RNE .cse10 c_~I~0))) (.cse7 (fp.neg .cse5))) (let ((.cse1 (fp.geq .cse4 .cse7)) (.cse3 (fp.leq .cse6 .cse5)) (.cse2 (fp.geq .cse6 .cse7)) (.cse0 (fp.leq .cse4 .cse5))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (not .cse1) (and .cse3 .cse2) (not .cse0))))) is different from false [2018-10-26 22:17:11,499 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~I~0))) (.cse3 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse1 (fp.geq .cse2 (fp.neg .cse3))) (.cse0 (fp.leq .cse2 .cse3))) (or (and .cse0 .cse1) (not .cse1) (not .cse0)))) is different from false [2018-10-26 22:17:13,524 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) |c_main_#t~ret6|) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) |c_main_#t~ret6|)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) |c_main_#t~ret6|))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-10-26 22:17:27,134 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_6 .cse1)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_6) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_6)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_6)) ((_ to_fp 8 24) RNE 5.0)) (not (fp.geq v_prenex_6 (fp.neg .cse1))))))) is different from false [2018-10-26 22:17:29,172 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_RANDOM_INPUT_~x~0_26 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_RANDOM_INPUT_~x~0_26 .cse0)) (not (fp.geq v_RANDOM_INPUT_~x~0_26 (fp.neg .cse0))) (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_RANDOM_INPUT_~x~0_26)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))))) (forall ((v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (or (not (fp.leq v_prenex_6 .cse1)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_6) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_6)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_6)) ((_ to_fp 8 24) RNE 5.0)) (not (fp.geq v_prenex_6 (fp.neg .cse1))))))) is different from true [2018-10-26 22:17:29,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:29,183 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:17:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:17:43,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:17:43,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 22:17:43,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:17:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-26 22:17:43,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 22:17:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 22:17:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=90, Unknown=15, NotChecked=270, Total=420 [2018-10-26 22:17:43,640 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 12 states. [2018-10-26 22:17:43,854 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-26 22:18:28,020 WARN L179 SmtUtils]: Spent 9.81 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 22:18:30,881 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0))) (and (fp.leq c_~I~0 .cse0) (let ((.cse2 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((~Y~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) ~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) ~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Y~0)) (fp.neg ((_ to_fp 8 24) RNE 5.0)))) (fp.leq ~Y~0 .cse1) (fp.geq ~Y~0 (fp.neg .cse1))))) .cse2) (and .cse2 (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 1.0))) (and (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) v_prenex_5) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) v_prenex_5)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_prenex_5)) ((_ to_fp 8 24) RNE 5.0))) (fp.leq v_prenex_5 .cse3) (fp.geq v_prenex_5 (fp.neg .cse3)))))))) (fp.geq c_~I~0 (fp.neg .cse0)))) is different from false [2018-10-26 22:18:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:35,036 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-10-26 22:18:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:18:35,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-10-26 22:18:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:35,038 INFO L225 Difference]: With dead ends: 109 [2018-10-26 22:18:35,038 INFO L226 Difference]: Without dead ends: 107 [2018-10-26 22:18:35,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=94, Invalid=229, Unknown=27, NotChecked=462, Total=812 [2018-10-26 22:18:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-26 22:18:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-10-26 22:18:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 22:18:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-10-26 22:18:35,057 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 87 [2018-10-26 22:18:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:35,058 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-10-26 22:18:35,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 22:18:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-10-26 22:18:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 22:18:35,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:35,059 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:35,060 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:35,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 170216041, now seen corresponding path program 3 times [2018-10-26 22:18:35,062 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 22:18:35,063 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:18:35,067 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 22:18:36,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-26 22:18:36,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:36,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:50,857 WARN L179 SmtUtils]: Spent 5.10 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:18:52,887 WARN L832 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) is different from false [2018-10-26 22:18:54,903 WARN L854 $PredicateComparison]: unable to prove that (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) is different from true [2018-10-26 22:18:56,931 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0))))) is different from false [2018-10-26 22:19:22,910 WARN L179 SmtUtils]: Spent 7.10 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 22:19:24,959 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 5.0))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (= |c_old(~X~0)| c_~Y~0) (fp.geq c_~X~0 (fp.neg .cse0)) (fp.leq c_~X~0 .cse0))) is different from false [2018-10-26 22:19:27,008 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Y~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) ~Z~0)))) (fp.leq c_~Y~0 .cse0) (fp.geq c_~Y~0 (fp.neg .cse0)) (fp.geq c_~X~0 (fp.neg .cse1)) (fp.leq c_~X~0 .cse1))) is different from false [2018-10-26 22:19:29,068 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq c_~Z~0 (fp.neg .cse0)) (fp.leq c_~Z~0 .cse0) (fp.geq c_~X~0 (fp.neg .cse1)) (= c_~X~0 c_~Y~0) (exists ((v_subst_1 (_ FloatingPoint 8 24))) (= (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~Z~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Z~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) v_subst_1)) c_~X~0)) (fp.leq c_~X~0 .cse1))) is different from false [2018-10-26 22:19:31,114 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 ~Z~0) (fp.mul RNE .cse4 ~Z~0)) (fp.mul RNE .cse5 v_subst_1)))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq ~Z~0 .cse2) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 ~Z~0))))))) is different from false [2018-10-26 22:19:33,154 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 ~Z~0) (fp.mul RNE .cse4 ~Z~0)) (fp.mul RNE .cse5 v_subst_1)))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq ~Z~0 .cse2) (= c_~X~0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 ~Z~0))))))) is different from true [2018-10-26 22:19:49,568 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) RNE 5.0)) (.cse1 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse0 ((_ to_fp 8 24) RNE 1.0)) (.cse2 (fp.add RNE (fp.add RNE (fp.mul RNE .cse1 v_prenex_11) (fp.mul RNE .cse3 v_prenex_11)) (fp.mul RNE .cse4 v_prenex_10))) (.cse5 (fp.neg .cse6))) (and (fp.leq v_prenex_11 .cse0) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) (fp.mul RNE .cse3 .cse2)) (fp.mul RNE .cse4 v_prenex_11)) .cse5)) (fp.geq v_prenex_11 (fp.neg .cse0)) (fp.leq .cse2 .cse6) (fp.geq .cse2 .cse5))))) .cse7) (and (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse11 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse12 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse13 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse10 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse11 v_prenex_8) (fp.mul RNE .cse12 v_prenex_8)) (fp.mul RNE .cse13 v_prenex_7))) (.cse9 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse8 .cse9) (fp.geq v_prenex_8 (fp.neg .cse10)) (fp.geq .cse8 (fp.neg .cse9)) (fp.leq v_prenex_8 .cse10) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse11 .cse8) (fp.mul RNE .cse12 .cse8)) (fp.mul RNE .cse13 v_prenex_8)) .cse9)))))) .cse7) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse20 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse21 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse15 ((_ to_fp 8 24) RNE 5.0)) (.cse14 (fp.add RNE (fp.add RNE (fp.mul RNE .cse19 ~Z~0) (fp.mul RNE .cse20 ~Z~0)) (fp.mul RNE .cse21 v_subst_1)))) (let ((.cse16 ((_ to_fp 8 24) RNE 1.0)) (.cse18 (fp.add RNE (fp.add RNE (fp.mul RNE .cse19 .cse14) (fp.mul RNE .cse20 .cse14)) (fp.mul RNE .cse21 ~Z~0))) (.cse17 (fp.neg .cse15))) (and (fp.leq .cse14 .cse15) (fp.geq ~Z~0 (fp.neg .cse16)) (fp.geq .cse14 .cse17) (fp.leq ~Z~0 .cse16) (fp.leq .cse18 .cse15) (fp.geq .cse18 .cse17))))))))) is different from false [2018-10-26 22:20:03,933 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((v_subst_1 (_ FloatingPoint 8 24)) (~Z~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse1 ((_ to_fp 8 24) RNE 5.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse5 ~Z~0) (fp.mul RNE .cse6 ~Z~0)) (fp.mul RNE .cse7 v_subst_1)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse4 (fp.add RNE (fp.add RNE (fp.mul RNE .cse5 .cse0) (fp.mul RNE .cse6 .cse0)) (fp.mul RNE .cse7 ~Z~0))) (.cse3 (fp.neg .cse1))) (and (fp.leq .cse0 .cse1) (fp.geq ~Z~0 (fp.neg .cse2)) (fp.geq .cse0 .cse3) (fp.leq ~Z~0 .cse2) (fp.leq .cse4 .cse1) (fp.geq .cse4 .cse3)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse8 (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse13 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse14 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse11 ((_ to_fp 8 24) RNE 1.0)) (.cse9 (fp.add RNE (fp.add RNE (fp.mul RNE .cse12 v_prenex_8) (fp.mul RNE .cse13 v_prenex_8)) (fp.mul RNE .cse14 v_prenex_7))) (.cse10 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse9 .cse10) (fp.geq v_prenex_8 (fp.neg .cse11)) (fp.geq .cse9 (fp.neg .cse10)) (fp.leq v_prenex_8 .cse11) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse12 .cse9) (fp.mul RNE .cse13 .cse9)) (fp.mul RNE .cse14 v_prenex_8)) .cse10))))))) (and .cse8 (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse21 ((_ to_fp 8 24) RNE 5.0)) (.cse16 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse18 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse19 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse15 ((_ to_fp 8 24) RNE 1.0)) (.cse17 (fp.add RNE (fp.add RNE (fp.mul RNE .cse16 v_prenex_11) (fp.mul RNE .cse18 v_prenex_11)) (fp.mul RNE .cse19 v_prenex_10))) (.cse20 (fp.neg .cse21))) (and (fp.leq v_prenex_11 .cse15) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse16 .cse17) (fp.mul RNE .cse18 .cse17)) (fp.mul RNE .cse19 v_prenex_11)) .cse20)) (fp.geq v_prenex_11 (fp.neg .cse15)) (fp.leq .cse17 .cse21) (fp.geq .cse17 .cse20)))))))) is different from false [2018-10-26 22:20:14,224 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 v_prenex_8) (fp.mul RNE .cse4 v_prenex_8)) (fp.mul RNE .cse5 v_prenex_7))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq v_prenex_8 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq v_prenex_8 .cse2) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 v_prenex_8)) .cse1)))))) (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE 5.0)) (.cse7 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 v_prenex_11) (fp.mul RNE .cse9 v_prenex_11)) (fp.mul RNE .cse10 v_prenex_10))) (.cse11 (fp.neg .cse12))) (and (fp.leq v_prenex_11 .cse6) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) (fp.mul RNE .cse9 .cse8)) (fp.mul RNE .cse10 v_prenex_11)) .cse11)) (fp.geq v_prenex_11 (fp.neg .cse6)) (fp.leq .cse8 .cse12) (fp.geq .cse8 .cse11)))))) is different from false [2018-10-26 22:20:16,263 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse2 ((_ to_fp 8 24) RNE 1.0)) (.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 v_prenex_8) (fp.mul RNE .cse4 v_prenex_8)) (fp.mul RNE .cse5 v_prenex_7))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq v_prenex_8 (fp.neg .cse2)) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq v_prenex_8 .cse2) (not (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse3 .cse0) (fp.mul RNE .cse4 .cse0)) (fp.mul RNE .cse5 v_prenex_8)) .cse1)))))) (exists ((v_prenex_11 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) RNE 5.0)) (.cse7 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 ((_ to_fp 8 24) RNE 1.0)) (.cse8 (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 v_prenex_11) (fp.mul RNE .cse9 v_prenex_11)) (fp.mul RNE .cse10 v_prenex_10))) (.cse11 (fp.neg .cse12))) (and (fp.leq v_prenex_11 .cse6) (not (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse7 .cse8) (fp.mul RNE .cse9 .cse8)) (fp.mul RNE .cse10 v_prenex_11)) .cse11)) (fp.geq v_prenex_11 (fp.neg .cse6)) (fp.leq .cse8 .cse12) (fp.geq .cse8 .cse11)))))) is different from true [2018-10-26 22:20:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 63 not checked. [2018-10-26 22:20:16,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:20:28,309 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-10-26 22:20:32,307 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-10-26 22:20:34,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE (fp.add RNE (fp.mul RNE ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul RNE ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) RNE 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-10-26 22:20:54,310 WARN L179 SmtUtils]: Spent 19.91 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 22:21:07,607 WARN L179 SmtUtils]: Spent 13.30 s on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 22:21:28,920 WARN L179 SmtUtils]: Spent 21.31 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 22:21:45,413 WARN L179 SmtUtils]: Spent 16.49 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 22:21:47,436 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse4 (fp.neg .cse5)) (.cse1 (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 c_~X~0) (fp.mul RNE .cse2 c_~X~0)) (fp.mul RNE .cse3 v_prenex_13)))) (or (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 .cse1) (fp.mul RNE .cse2 .cse1)) (fp.mul RNE .cse3 c_~X~0)) .cse4) (not (fp.geq .cse1 .cse4)) (not (fp.leq .cse1 .cse5)))))) (forall ((v_~Z~0_29 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 v_~Z~0_29))) (.cse7 ((_ to_fp 8 24) RNE 5.0))) (or (not (fp.leq .cse6 .cse7)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 .cse6) (fp.mul RNE .cse9 .cse6)) (fp.mul RNE .cse10 c_~X~0)) .cse7) (not (fp.geq .cse6 (fp.neg .cse7)))))))) is different from false [2018-10-26 22:21:49,511 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) RNE 5.0))) (let ((.cse4 (fp.neg .cse5)) (.cse1 (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 c_~X~0) (fp.mul RNE .cse2 c_~X~0)) (fp.mul RNE .cse3 v_prenex_13)))) (or (fp.geq (fp.add RNE (fp.add RNE (fp.mul RNE .cse0 .cse1) (fp.mul RNE .cse2 .cse1)) (fp.mul RNE .cse3 c_~X~0)) .cse4) (not (fp.geq .cse1 .cse4)) (not (fp.leq .cse1 .cse5)))))) (forall ((v_~Z~0_29 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 8 24) RNE (/ 50000001.0 100000000.0))) (.cse9 ((_ to_fp 8 24) RNE (/ 30000001.0 100000000.0))) (.cse10 ((_ to_fp 8 24) RNE (/ 20000001.0 100000000.0)))) (let ((.cse6 (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 c_~X~0) (fp.mul RNE .cse9 c_~X~0)) (fp.mul RNE .cse10 v_~Z~0_29))) (.cse7 ((_ to_fp 8 24) RNE 5.0))) (or (not (fp.leq .cse6 .cse7)) (fp.leq (fp.add RNE (fp.add RNE (fp.mul RNE .cse8 .cse6) (fp.mul RNE .cse9 .cse6)) (fp.mul RNE .cse10 c_~X~0)) .cse7) (not (fp.geq .cse6 (fp.neg .cse7)))))))) is different from true [2018-10-26 22:21:49,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:21:49,525 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e51a39-e1fa-4b90-9082-d81a6fc02c9d/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:21:49,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:22:41,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-26 22:22:41,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-10-26 22:22:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-26 22:22:41,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:22:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:22:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=148, Unknown=27, NotChecked=420, Total=650 [2018-10-26 22:22:41,340 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 20 states. [2018-10-26 22:23:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:23:00,126 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. No stderr output. 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:893) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java: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) ... 43 more [2018-10-26 22:23:00,129 INFO L168 Benchmark]: Toolchain (without parser) took 557194.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 949.2 MB in the beginning and 969.9 MB in the end (delta: -20.7 MB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:00,130 INFO L168 Benchmark]: CDTParser took 0.19 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:23:00,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.67 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.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:23:00,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.05 ms. Allocated memory is still 1.0 GB. Free memory was 938.5 MB in the beginning and 933.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:23:00,131 INFO L168 Benchmark]: Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:23:00,131 INFO L168 Benchmark]: RCFGBuilder took 1095.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:00,143 INFO L168 Benchmark]: TraceAbstraction took 555777.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 169.6 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:00,146 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.19 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 260.67 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.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 27.05 ms. Allocated memory is still 1.0 GB. Free memory was 938.5 MB in the beginning and 933.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1095.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 555777.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 169.6 MB). Peak memory consumption was 218.9 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. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: 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...