./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 .............................................................................................................................................................................................................................................................................................................................................................. 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_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:34:18,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:34:18,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:34:18,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:34:18,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:34:18,661 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:34:18,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:34:18,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:34:18,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:34:18,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:34:18,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:34:18,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:34:18,666 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:34:18,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:34:18,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:34:18,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:34:18,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:34:18,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:34:18,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:34:18,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:34:18,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:34:18,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:34:18,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:34:18,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:34:18,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:34:18,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:34:18,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:34:18,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:34:18,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:34:18,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:34:18,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:34:18,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:34:18,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:34:18,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:34:18,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:34:18,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:34:18,683 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 03:34:18,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:34:18,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:34:18,695 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:34:18,695 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:34:18,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:34:18,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:34:18,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:34:18,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:34:18,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:34:18,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:34:18,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:34:18,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:34:18,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:34:18,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:34:18,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:34:18,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:34:18,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:34:18,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:34:18,700 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:34:18,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:34:18,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:34:18,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:34:18,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:34:18,700 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_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-10 03:34:18,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:34:18,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:34:18,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:34:18,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:34:18,741 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:34:18,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:18,786 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/b51c82094/893e595987234ddab7fa780823e751a3/FLAGbaf21cd26 [2018-11-10 03:34:19,084 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:34:19,084 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:19,089 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/b51c82094/893e595987234ddab7fa780823e751a3/FLAGbaf21cd26 [2018-11-10 03:34:19,099 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/b51c82094/893e595987234ddab7fa780823e751a3 [2018-11-10 03:34:19,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:34:19,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:34:19,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:34:19,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:34:19,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:34:19,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291667c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19, skipping insertion in model container [2018-11-10 03:34:19,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:34:19,129 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:34:19,237 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:34:19,241 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:34:19,257 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:34:19,267 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:34:19,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19 WrapperNode [2018-11-10 03:34:19,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:34:19,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:34:19,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:34:19,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:34:19,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... [2018-11-10 03:34:19,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:34:19,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:34:19,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:34:19,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:34:19,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:34:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 03:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 03:34:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 03:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:34:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:34:19,481 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:34:19,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:34:19 BoogieIcfgContainer [2018-11-10 03:34:19,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:34:19,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:34:19,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:34:19,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:34:19,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:34:19" (1/3) ... [2018-11-10 03:34:19,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bf3270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:19, skipping insertion in model container [2018-11-10 03:34:19,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:19" (2/3) ... [2018-11-10 03:34:19,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bf3270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:19, skipping insertion in model container [2018-11-10 03:34:19,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:34:19" (3/3) ... [2018-11-10 03:34:19,487 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:19,492 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:34:19,496 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:34:19,506 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:34:19,523 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:34:19,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:34:19,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:34:19,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:34:19,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:34:19,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:34:19,524 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:34:19,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:34:19,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:34:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-10 03:34:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:19,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:19,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:19,546 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:19,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-10 03:34:19,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:34:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:34:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:34:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:19,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:34:19,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:34:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:34:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:34:19,666 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-10 03:34:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:19,716 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-10 03:34:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:34:19,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 03:34:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:19,723 INFO L225 Difference]: With dead ends: 75 [2018-11-10 03:34:19,723 INFO L226 Difference]: Without dead ends: 46 [2018-11-10 03:34:19,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:34:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-10 03:34:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-11-10 03:34:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:34:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-10 03:34:19,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-10 03:34:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:19,757 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-10 03:34:19,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:34:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-10 03:34:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:19,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:19,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:19,758 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:19,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-11-10 03:34:19,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:34:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:34:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:34:19,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:19,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:34:19,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:34:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:34:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:34:19,801 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-10 03:34:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:19,852 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-10 03:34:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:34:19,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 03:34:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:19,854 INFO L225 Difference]: With dead ends: 50 [2018-11-10 03:34:19,854 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 03:34:19,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:34:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 03:34:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-11-10 03:34:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 03:34:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-10 03:34:19,860 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-10 03:34:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:19,860 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-10 03:34:19,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:34:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-10 03:34:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:19,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:19,861 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:19,861 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:19,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-11-10 03:34:19,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:34:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:34:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:34:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:34:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:34:19,893 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 03:34:19,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:34:19 BoogieIcfgContainer [2018-11-10 03:34:19,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:34:19,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:34:19,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:34:19,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:34:19,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:34:19" (3/4) ... [2018-11-10 03:34:19,920 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:34:19,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:34:19,921 INFO L168 Benchmark]: Toolchain (without parser) took 819.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -102.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:19,923 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:34:19,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:19,924 INFO L168 Benchmark]: Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:19,924 INFO L168 Benchmark]: RCFGBuilder took 192.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:19,924 INFO L168 Benchmark]: TraceAbstraction took 433.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:34:19,925 INFO L168 Benchmark]: Witness Printer took 4.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:34:19,927 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 433.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-11-10 03:34:21,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:34:21,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:34:21,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:34:21,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:34:21,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:34:21,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:34:21,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:34:21,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:34:21,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:34:21,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:34:21,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:34:21,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:34:21,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:34:21,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:34:21,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:34:21,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:34:21,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:34:21,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:34:21,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:34:21,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:34:21,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:34:21,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:34:21,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:34:21,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:34:21,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:34:21,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:34:21,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:34:21,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:34:21,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:34:21,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:34:21,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:34:21,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:34:21,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:34:21,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:34:21,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:34:21,342 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 03:34:21,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:34:21,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:34:21,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:34:21,354 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:34:21,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:34:21,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:34:21,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:34:21,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:34:21,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:34:21,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:34:21,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:34:21,357 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 03:34:21,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:34:21,358 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:34:21,358 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:34:21,358 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_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-10 03:34:21,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:34:21,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:34:21,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:34:21,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:34:21,397 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:34:21,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:21,432 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/19f449f94/b24e853991fb47cebe66e2074c122595/FLAGfa419cc2f [2018-11-10 03:34:21,824 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:34:21,825 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:21,830 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/19f449f94/b24e853991fb47cebe66e2074c122595/FLAGfa419cc2f [2018-11-10 03:34:21,839 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/data/19f449f94/b24e853991fb47cebe66e2074c122595 [2018-11-10 03:34:21,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:34:21,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:34:21,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:34:21,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:34:21,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:34:21,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:21" (1/1) ... [2018-11-10 03:34:21,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629197e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:21, skipping insertion in model container [2018-11-10 03:34:21,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:21" (1/1) ... [2018-11-10 03:34:21,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:34:21,876 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:34:21,986 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:34:21,990 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:34:22,007 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:34:22,019 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:34:22,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22 WrapperNode [2018-11-10 03:34:22,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:34:22,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:34:22,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:34:22,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:34:22,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... [2018-11-10 03:34:22,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:34:22,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:34:22,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:34:22,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:34:22,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:34:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:34:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:34:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:34:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:34:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 03:34:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 03:34:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:34:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-10 03:34:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:34:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:34:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:34:31,210 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:34:31,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:34:31 BoogieIcfgContainer [2018-11-10 03:34:31,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:34:31,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:34:31,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:34:31,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:34:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:34:21" (1/3) ... [2018-11-10 03:34:31,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccc44cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:31, skipping insertion in model container [2018-11-10 03:34:31,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:22" (2/3) ... [2018-11-10 03:34:31,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccc44cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:31, skipping insertion in model container [2018-11-10 03:34:31,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:34:31" (3/3) ... [2018-11-10 03:34:31,216 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-10 03:34:31,222 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:34:31,227 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:34:31,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:34:31,254 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:34:31,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:34:31,255 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:34:31,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:34:31,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:34:31,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:34:31,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:34:31,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:34:31,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:34:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-10 03:34:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:31,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:31,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:31,274 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:31,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-10 03:34:31,280 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:34:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 03:34:31,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:33,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:34:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:34:33,104 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:34:33,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:33,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:34:33,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:34:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:34:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:34:33,142 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-10 03:34:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:37,435 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-10 03:34:37,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:34:37,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 03:34:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:37,442 INFO L225 Difference]: With dead ends: 70 [2018-11-10 03:34:37,442 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 03:34:37,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:34:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 03:34:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-10 03:34:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:34:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-10 03:34:37,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-10 03:34:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:37,470 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-10 03:34:37,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:34:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-10 03:34:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:37,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:37,471 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:37,471 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:37,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-11-10 03:34:37,472 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:34:37,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 03:34:37,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:38,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:34:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:34:38,663 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:34:38,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:38,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:34:38,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:34:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:34:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:34:38,692 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-10 03:34:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:34:44,658 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-10 03:34:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:34:44,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 03:34:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:34:44,660 INFO L225 Difference]: With dead ends: 48 [2018-11-10 03:34:44,660 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 03:34:44,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:34:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 03:34:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 03:34:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 03:34:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-10 03:34:44,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-10 03:34:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:34:44,665 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-10 03:34:44,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:34:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-10 03:34:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 03:34:44,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:34:44,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:34:44,666 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:34:44,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:34:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-11-10 03:34:44,667 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:34:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 03:34:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:34:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:34:45,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:34:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:34:45,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:34:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:34:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:34:45,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:34:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:34:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:34:45,893 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-10 03:35:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:35:04,021 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-10 03:35:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:35:04,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 03:35:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:35:04,022 INFO L225 Difference]: With dead ends: 55 [2018-11-10 03:35:04,023 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 03:35:04,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:35:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 03:35:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-10 03:35:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 03:35:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-10 03:35:04,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-11-10 03:35:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:35:04,027 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-10 03:35:04,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:35:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-10 03:35:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:35:04,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:35:04,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:35:04,028 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:35:04,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:35:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-11-10 03:35:04,029 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:35:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 03:35:04,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:35:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:35:07,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:35:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:35:07,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:35:07,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:35:07,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:35:07,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:35:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:35:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:35:07,449 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-11-10 03:35:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:35:12,946 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-11-10 03:35:12,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:35:12,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-10 03:35:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:35:12,947 INFO L225 Difference]: With dead ends: 54 [2018-11-10 03:35:12,947 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 03:35:12,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:35:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 03:35:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-11-10 03:35:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 03:35:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-10 03:35:12,954 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-11-10 03:35:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:35:12,954 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-10 03:35:12,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:35:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-10 03:35:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:35:12,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:35:12,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:35:12,955 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:35:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:35:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-11-10 03:35:12,956 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:35:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-10 03:35:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:35:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:35:16,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:35:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:35:16,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:35:18,745 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-10 03:35:22,486 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-11-10 03:35:25,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-11-10 03:35:27,395 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-11-10 03:35:29,803 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-11-10 03:35:32,224 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-11-10 03:35:34,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-11-10 03:35:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-10 03:35:34,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:35:34,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 03:35:34,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:35:34,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:35:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-11-10 03:35:34,694 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-11-10 03:35:37,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-11-10 03:35:39,545 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= .cse0 c_main_~SqrtR__Input~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-11-10 03:35:42,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0))) is different from true [2018-11-10 03:35:44,395 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0)) c_main_~SqrtR__xnp1~0) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0))) is different from true [2018-11-10 03:36:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:36:06,981 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2018-11-10 03:36:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:36:07,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-10 03:36:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:36:07,290 INFO L225 Difference]: With dead ends: 100 [2018-11-10 03:36:07,290 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 03:36:07,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=31, Invalid=46, Unknown=11, NotChecked=152, Total=240 [2018-11-10 03:36:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 03:36:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2018-11-10 03:36:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 03:36:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-11-10 03:36:07,299 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2018-11-10 03:36:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:36:07,299 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-11-10 03:36:07,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:36:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-11-10 03:36:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 03:36:07,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:36:07,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:36:07,300 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:36:07,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:36:07,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2022219950, now seen corresponding path program 1 times [2018-11-10 03:36:07,300 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:36:07,300 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 03:36:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:36:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:36:10,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:36:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:36:10,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:36:10,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:36:10,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:36:10,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:36:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:36:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:36:10,810 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 7 states. [2018-11-10 03:36:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:36:20,853 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-11-10 03:36:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:36:20,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-10 03:36:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:36:20,855 INFO L225 Difference]: With dead ends: 78 [2018-11-10 03:36:20,856 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 03:36:20,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:36:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 03:36:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-10 03:36:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 03:36:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-11-10 03:36:20,864 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2018-11-10 03:36:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:36:20,865 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-10 03:36:20,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:36:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-10 03:36:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 03:36:20,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:36:20,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:36:20,865 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:36:20,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:36:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1630637767, now seen corresponding path program 1 times [2018-11-10 03:36:20,866 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:36:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-10 03:36:20,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:36:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:36:24,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:36:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:36:24,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:36:24,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:36:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:36:24,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:36:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:36:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:36:24,340 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 7 states. [2018-11-10 03:36:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:36:44,201 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-10 03:36:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:36:44,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-10 03:36:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:36:44,203 INFO L225 Difference]: With dead ends: 68 [2018-11-10 03:36:44,203 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 03:36:44,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:36:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 03:36:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-10 03:36:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 03:36:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-10 03:36:44,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2018-11-10 03:36:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:36:44,212 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-10 03:36:44,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:36:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-10 03:36:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:36:44,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:36:44,212 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:36:44,212 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:36:44,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:36:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-11-10 03:36:44,213 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:36:44,213 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-10 03:36:44,215 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:36:49,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:36:49,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:36:49,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:36:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:36:52,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:36:54,553 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-10 03:36:56,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from true [2018-11-10 03:36:59,430 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-11-10 03:37:01,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-11-10 03:37:04,748 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-10 03:37:07,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-10 03:37:10,137 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-10 03:37:12,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-10 03:37:15,358 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-10 03:37:17,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-10 03:37:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-10 03:37:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:37:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-10 03:37:18,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:37:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:37:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=41, Unknown=10, NotChecked=80, Total=156 [2018-11-10 03:37:18,056 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 13 states. [2018-11-10 03:37:20,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0))) is different from true [2018-11-10 03:37:23,351 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-10 03:37:26,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0))) is different from true [2018-11-10 03:37:28,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 ((_ to_fp 11 53) RNE 3.0)) (.cse4 ((_ to_fp 11 53) RNE 8.0)) (.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse0 .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0) .cse0))))) .cse4) c_main_~SqrtR__xnp1~0) (= .cse0 c_main_~SqrtR__Input~0) (= .cse0 c_main_~SqrtR__xn~0) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0))) is different from true [2018-11-10 03:37:36,653 WARN L179 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-10 03:38:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:06,440 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-10 03:38:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:38:06,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-10 03:38:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:06,735 INFO L225 Difference]: With dead ends: 110 [2018-11-10 03:38:06,735 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 03:38:06,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=46, Invalid=66, Unknown=14, NotChecked=216, Total=342 [2018-11-10 03:38:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 03:38:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2018-11-10 03:38:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 03:38:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-11-10 03:38:06,745 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 26 [2018-11-10 03:38:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:06,745 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-11-10 03:38:06,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:38:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-10 03:38:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 03:38:06,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:06,746 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:38:06,746 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:06,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-11-10 03:38:06,747 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:38:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-10 03:38:06,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:12,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:38:12,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:14,300 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-11-10 03:38:16,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-11-10 03:38:18,764 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-11-10 03:38:21,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-11-10 03:38:23,546 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-11-10 03:38:25,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-11-10 03:38:28,323 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from false [2018-11-10 03:38:30,725 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) is different from true [2018-11-10 03:38:38,129 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 03:38:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-11-10 03:38:38,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:38:38,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-10 03:38:38,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:38:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:38:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2018-11-10 03:38:38,203 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 14 states. [2018-11-10 03:38:40,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse1 (let ((.cse2 (fp.div RNE .cse0 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32)))))) (fp.add RNE .cse2 .cse2)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse1) (fp.mul RNE c_~_EPS~0 .cse1))))) is different from true [2018-11-10 03:38:57,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div RNE .cse2 c_main_~main__d~0))) (fp.add RNE .cse1 .cse1)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~main__d~0))) is different from true [2018-11-10 03:39:00,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (let ((.cse1 (let ((.cse2 (fp.div RNE .cse0 c_main_~SqrtR__Input~0))) (fp.add RNE .cse2 .cse2)))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse1) (fp.mul RNE c_~_EPS~0 .cse1))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-11-10 03:39:02,449 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add RNE c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse1 (fp.add RNE .cse1 ((_ to_fp 11 53) RNE (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-11-10 03:39:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:18,624 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2018-11-10 03:39:18,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:39:18,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-10 03:39:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:39:18,626 INFO L225 Difference]: With dead ends: 104 [2018-11-10 03:39:18,626 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 03:39:18,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2018-11-10 03:39:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 03:39:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2018-11-10 03:39:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 03:39:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2018-11-10 03:39:18,646 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 33 [2018-11-10 03:39:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:39:18,646 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2018-11-10 03:39:18,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:39:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-10 03:39:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 03:39:18,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:39:18,647 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:39:18,647 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:39:18,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-11-10 03:39:18,648 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:39:18,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-10 03:39:18,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:23,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:39:23,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:39:24,897 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-10 03:39:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:39:24,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:24,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:39:24,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:39:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:39:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:39:24,955 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 8 states. [2018-11-10 03:39:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:34,493 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2018-11-10 03:39:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:39:34,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-10 03:39:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:39:34,501 INFO L225 Difference]: With dead ends: 113 [2018-11-10 03:39:34,501 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 03:39:34,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:39:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 03:39:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 57. [2018-11-10 03:39:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 03:39:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2018-11-10 03:39:34,514 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 33 [2018-11-10 03:39:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:39:34,515 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2018-11-10 03:39:34,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:39:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-10 03:39:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:39:34,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:39:34,516 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:39:34,516 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:39:34,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1112505107, now seen corresponding path program 1 times [2018-11-10 03:39:34,516 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:39:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-10 03:39:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:41,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:39:41,690 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:39:41,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:41,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:39:41,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:39:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:39:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:39:41,776 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 4 states. [2018-11-10 03:39:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:49,315 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-10 03:39:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:39:49,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 03:39:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:39:49,316 INFO L225 Difference]: With dead ends: 92 [2018-11-10 03:39:49,316 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 03:39:49,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:39:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 03:39:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-10 03:39:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 03:39:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 03:39:49,326 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 37 [2018-11-10 03:39:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:39:49,326 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 03:39:49,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:39:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-10 03:39:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:39:49,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:39:49,327 INFO L375 BasicCegarLoop]: trace histogram [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-11-10 03:39:49,327 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:39:49,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-11-10 03:39:49,328 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:39:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-10 03:39:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:56,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:40:06,039 WARN L179 SmtUtils]: Spent 3.84 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 03:40:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:40:06,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:40:08,441 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))) is different from false [2018-11-10 03:40:10,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))) is different from true [2018-11-10 03:40:13,403 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from false [2018-11-10 03:40:16,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from true [2018-11-10 03:40:18,644 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from false [2018-11-10 03:40:21,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) is different from true [2018-11-10 03:40:23,894 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) .cse2))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse2 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))))) is different from false [2018-11-10 03:40:26,520 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse1 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) .cse2))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse2 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0)))))) is different from true [2018-11-10 03:40:27,745 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 03:40:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-11-10 03:40:27,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:40:27,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-10 03:40:27,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:40:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:40:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=62, Unknown=8, NotChecked=76, Total=182 [2018-11-10 03:40:27,845 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-11-10 03:40:30,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__d~0 .cse0) (let ((.cse3 (fp.add RNE c_main_~main__d~0 ((_ to_fp 11 53) RNE (_ bv1 32))))) (let ((.cse2 (fp.div RNE .cse0 .cse3))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse3 .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) .cse3) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse1 .cse2)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-11-10 03:40:33,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse1 (fp.div RNE .cse2 c_main_~main__d~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~main__d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~main__d~0))) is different from true [2018-11-10 03:40:35,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse1 (fp.div RNE .cse2 c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse0 .cse1)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse0 .cse0))))) (= (fp.add RNE .cse2 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-11-10 03:40:38,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE (_ bv1 32))) c_main_~SqrtR__Input~0) (let ((.cse1 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0)))) (fp.gt (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse1 c_main_~SqrtR__xn~0)) (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse1 .cse1)))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0))) is different from true [2018-11-10 03:41:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:07,247 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2018-11-10 03:41:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:41:07,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-10 03:41:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:41:07,249 INFO L225 Difference]: With dead ends: 108 [2018-11-10 03:41:07,249 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 03:41:07,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=12, NotChecked=184, Total=306 [2018-11-10 03:41:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 03:41:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2018-11-10 03:41:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 03:41:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-10 03:41:07,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2018-11-10 03:41:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:41:07,266 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-10 03:41:07,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:41:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-10 03:41:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:41:07,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:41:07,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-10 03:41:07,267 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:41:07,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2041929248, now seen corresponding path program 1 times [2018-11-10 03:41:07,267 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:41:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-10 03:41:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:14,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:41:14,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:41:14,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:41:14,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:41:14,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:41:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:41:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:41:14,711 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 4 states. [2018-11-10 03:41:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:24,815 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-10 03:41:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:41:25,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 03:41:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:41:25,113 INFO L225 Difference]: With dead ends: 80 [2018-11-10 03:41:25,113 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 03:41:25,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:41:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 03:41:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-10 03:41:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 03:41:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-10 03:41:25,135 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 37 [2018-11-10 03:41:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:41:25,135 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-10 03:41:25,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:41:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-10 03:41:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 03:41:25,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:41:25,136 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:25,137 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:41:25,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 716182498, now seen corresponding path program 2 times [2018-11-10 03:41:25,137 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 03:41:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a07526e-4088-4031-bad0-62279813b43f/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-10 03:41:25,148 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:41:34,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:41:34,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:41:35,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:41,138 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-10 03:41:51,386 WARN L179 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 03:41:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:41:51,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:41:53,771 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-10 03:41:56,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from true [2018-11-10 03:41:58,680 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from false [2018-11-10 03:42:01,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.geq (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE c_main_~SqrtR__xn~0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) RNE 8.0))) .cse0)) is different from true [2018-11-10 03:42:02,382 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 03:42:02,583 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2018-11-10 03:42:02,583 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-10 03:42:02,586 INFO L168 Benchmark]: Toolchain (without parser) took 460743.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 949.2 MB in the beginning and 976.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 144.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:42:02,586 INFO L168 Benchmark]: CDTParser took 0.12 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-11-10 03:42:02,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.45 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:42:02,587 INFO L168 Benchmark]: Boogie Preprocessor took 27.12 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-11-10 03:42:02,587 INFO L168 Benchmark]: RCFGBuilder took 9162.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:42:02,587 INFO L168 Benchmark]: TraceAbstraction took 451374.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 170.0 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:42:02,589 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.12 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 177.45 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.12 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 9162.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 451374.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 170.0 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...