./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-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_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22373866aae52af60bd2dae8e24bb583522182de .................................................................................................................................................................................................................................................................................................................................. 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_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22373866aae52af60bd2dae8e24bb583522182de .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:38:10,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:38:10,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:38:10,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:38:10,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:38:10,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:38:10,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:38:10,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:38:10,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:38:10,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:38:10,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:38:10,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:38:10,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:38:10,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:38:10,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:38:10,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:38:10,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:38:10,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:38:10,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:38:10,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:38:10,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:38:10,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:38:10,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:38:10,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:38:10,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:38:10,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:38:10,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:38:10,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:38:10,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:38:10,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:38:10,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:38:10,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:38:10,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:38:10,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:38:10,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:38:10,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:38:10,187 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:38:10,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:38:10,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:38:10,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:38:10,202 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:38:10,203 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:38:10,203 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:38:10,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:38:10,204 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:38:10,204 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:38:10,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:38:10,204 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:38:10,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:38:10,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:38:10,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:38:10,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:38:10,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:38:10,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:38:10,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:38:10,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:38:10,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:38:10,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:38:10,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:38:10,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:38:10,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:38:10,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:38:10,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:38:10,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:38:10,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:38:10,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:38:10,210 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22373866aae52af60bd2dae8e24bb583522182de [2018-10-26 20:38:10,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:38:10,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:38:10,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:38:10,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:38:10,258 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:38:10,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:10,325 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/40de41a00/49fd62725add4ddc8b314cb9937c7a09/FLAG53db0528e [2018-10-26 20:38:10,663 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:38:10,664 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:10,671 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/40de41a00/49fd62725add4ddc8b314cb9937c7a09/FLAG53db0528e [2018-10-26 20:38:10,685 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/40de41a00/49fd62725add4ddc8b314cb9937c7a09 [2018-10-26 20:38:10,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:38:10,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:38:10,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:38:10,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:38:10,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:38:10,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3d73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10, skipping insertion in model container [2018-10-26 20:38:10,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:38:10,750 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:38:10,907 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:38:10,911 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:38:10,936 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:38:10,949 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:38:10,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10 WrapperNode [2018-10-26 20:38:10,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:38:10,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:38:10,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:38:10,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:38:10,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:38:10,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:38:10,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:38:10,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:38:10,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:10,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... [2018-10-26 20:38:11,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:38:11,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:38:11,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:38:11,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:38:11,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:38:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:38:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:38:11,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:38:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:38:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:38:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:38:11,665 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:38:11,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:38:11 BoogieIcfgContainer [2018-10-26 20:38:11,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:38:11,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:38:11,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:38:11,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:38:11,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:38:10" (1/3) ... [2018-10-26 20:38:11,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b463a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:38:11, skipping insertion in model container [2018-10-26 20:38:11,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:10" (2/3) ... [2018-10-26 20:38:11,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b463a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:38:11, skipping insertion in model container [2018-10-26 20:38:11,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:38:11" (3/3) ... [2018-10-26 20:38:11,674 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:11,684 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:38:11,691 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-26 20:38:11,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-10-26 20:38:11,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:38:11,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:38:11,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:38:11,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:38:11,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:38:11,745 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:38:11,745 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:38:11,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:38:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-10-26 20:38:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:38:11,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:38:11,769 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] [2018-10-26 20:38:11,771 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:38:11,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:38:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1836001814, now seen corresponding path program 1 times [2018-10-26 20:38:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:38:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:38:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:38:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:38:11,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:38:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:38:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:38:11,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:38:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:38:11,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:38:11,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:38:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:38:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:38:11,962 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-10-26 20:38:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:38:12,062 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2018-10-26 20:38:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:38:12,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-26 20:38:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:38:12,072 INFO L225 Difference]: With dead ends: 78 [2018-10-26 20:38:12,072 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 20:38:12,075 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-10-26 20:38:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 20:38:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-10-26 20:38:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 20:38:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-10-26 20:38:12,113 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2018-10-26 20:38:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:38:12,113 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-10-26 20:38:12,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:38:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-10-26 20:38:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:38:12,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:38:12,115 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] [2018-10-26 20:38:12,115 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:38:12,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:38:12,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1751306001, now seen corresponding path program 1 times [2018-10-26 20:38:12,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:38:12,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:38:12,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:38:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:38:12,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:38:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:38:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:38:12,162 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:38:12,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:38:12 BoogieIcfgContainer [2018-10-26 20:38:12,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:38:12,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:38:12,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:38:12,212 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:38:12,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:38:11" (3/4) ... [2018-10-26 20:38:12,217 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 20:38:12,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:38:12,218 INFO L168 Benchmark]: Toolchain (without parser) took 1529.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:38:12,219 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:38:12,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:38:12,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:38:12,221 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:38:12,221 INFO L168 Benchmark]: RCFGBuilder took 664.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:38:12,222 INFO L168 Benchmark]: TraceAbstraction took 544.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:38:12,222 INFO L168 Benchmark]: Witness Printer took 5.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:38:12,229 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.90 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 664.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 544.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 62]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of to_real at line 19, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L1] int __return_main; [L7] int __tmp_160_0; [L8] int __tmp_160_1; [L9] int __tmp_160_2; [L10] int __return_165; VAL [\old(__return_165)=5, \old(__return_main)=2, \old(__tmp_160_0)=8, \old(__tmp_160_1)=6, \old(__tmp_160_2)=7, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0] [L13] float main__X; [L14] float main__Y; [L15] float main__S; [L16] float main__R; [L17] float main__D; [L18] int main__i; [L19] main__Y = 0 [L20] main__i = 0 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L21] COND TRUE main__i < 100000 [L23] main__X = __VERIFIER_nondet_float() [L24] main__D = __VERIFIER_nondet_float() [L25] int main____CPAchecker_TMP_0; VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__D=1, main__i=0, main__X=3] [L26] COND TRUE main__X >= -128.0 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__D=1, main__i=0, main__X=3] [L28] COND TRUE main__X <= 128.0 [L30] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__D=1, main__i=0, main__X=3] [L31] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] int main____CPAchecker_TMP_1; VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__D=1, main__i=0, main__X=3] [L34] COND TRUE main__D >= 0.0 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__D=1, main__i=0, main__X=3] [L36] COND TRUE main__D <= 16.0 [L38] main____CPAchecker_TMP_1 = 1 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=1, main__i=0, main__X=3] [L39] COND TRUE main____CPAchecker_TMP_1 != 0 [L41] main__S = main__Y [L42] main__Y = main__X [L43] main__R = main__X - main__S VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=1, main__i=0, main__S=4, main__X=3, main__Y=3] [L44] COND TRUE main__R <= (-main__D) [L46] main__Y = main__S - main__D VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=1, main__i=0, main__S=4, main__X=3] [L48] int main____CPAchecker_TMP_2; VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=1, main__i=0, main__S=4, main__X=3] [L49] COND FALSE !(main__Y >= -129.0) VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=1, main__i=0, main__S=4, main__X=3] [L200] main____CPAchecker_TMP_2 = 0 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=1, main__i=0, main__S=4, main__X=3] [L56] int __tmp_1; [L57] __tmp_1 = main____CPAchecker_TMP_2 [L58] int __VERIFIER_assert__cond; [L59] __VERIFIER_assert__cond = __tmp_1 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=1, main__i=0, main__S=4, main__X=3] [L60] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=1, main__i=0, main__S=4, main__X=3] [L62] __VERIFIER_error() VAL [\old(__return_165)=0, \old(__tmp_160_0)=0, \old(__tmp_160_1)=0, \old(__tmp_160_2)=0, __return_165=0, __return_main=0, __tmp_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=1, main__i=0, main__S=4, main__X=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 2 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 68 SDtfs, 36 SDslu, 130 SDs, 0 SdLazy, 10 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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, 1 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:38:14,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:38:14,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:38:14,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:38:14,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:38:14,262 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:38:14,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:38:14,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:38:14,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:38:14,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:38:14,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:38:14,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:38:14,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:38:14,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:38:14,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:38:14,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:38:14,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:38:14,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:38:14,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:38:14,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:38:14,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:38:14,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:38:14,285 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:38:14,285 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:38:14,285 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:38:14,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:38:14,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:38:14,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:38:14,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:38:14,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:38:14,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:38:14,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:38:14,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:38:14,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:38:14,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:38:14,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:38:14,294 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 20:38:14,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:38:14,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:38:14,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:38:14,309 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:38:14,309 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:38:14,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:38:14,310 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:38:14,310 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:38:14,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:38:14,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:38:14,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:38:14,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:38:14,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:38:14,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:38:14,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:38:14,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:38:14,314 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:38:14,314 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:38:14,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:38:14,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:38:14,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:38:14,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:38:14,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:38:14,317 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 20:38:14,317 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:38:14,317 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 20:38:14,317 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 20:38:14,318 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_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22373866aae52af60bd2dae8e24bb583522182de [2018-10-26 20:38:14,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:38:14,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:38:14,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:38:14,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:38:14,394 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:38:14,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:14,448 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/70840de87/02c6dc327bf6430ca50a5b03a96ab6e7/FLAG73169470d [2018-10-26 20:38:14,833 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:38:14,833 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/sv-benchmarks/c/float-benchs/rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:14,841 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/70840de87/02c6dc327bf6430ca50a5b03a96ab6e7/FLAG73169470d [2018-10-26 20:38:14,856 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/data/70840de87/02c6dc327bf6430ca50a5b03a96ab6e7 [2018-10-26 20:38:14,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:38:14,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:38:14,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:38:14,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:38:14,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:38:14,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:38:14" (1/1) ... [2018-10-26 20:38:14,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d86d87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:14, skipping insertion in model container [2018-10-26 20:38:14,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:38:14" (1/1) ... [2018-10-26 20:38:14,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:38:14,907 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:38:15,081 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:38:15,094 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:38:15,131 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:38:15,144 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:38:15,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15 WrapperNode [2018-10-26 20:38:15,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:38:15,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:38:15,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:38:15,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:38:15,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:38:15,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:38:15,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:38:15,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:38:15,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... [2018-10-26 20:38:15,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:38:15,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:38:15,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:38:15,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:38:15,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:38:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:38:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:38:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:38:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:38:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:38:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:38:17,906 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:38:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:38:17 BoogieIcfgContainer [2018-10-26 20:38:17,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:38:17,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:38:17,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:38:17,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:38:17,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:38:14" (1/3) ... [2018-10-26 20:38:17,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54307862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:38:17, skipping insertion in model container [2018-10-26 20:38:17,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:38:15" (2/3) ... [2018-10-26 20:38:17,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54307862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:38:17, skipping insertion in model container [2018-10-26 20:38:17,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:38:17" (3/3) ... [2018-10-26 20:38:17,914 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant_true-unreach-call.c.v+lhb-reducer.c [2018-10-26 20:38:17,924 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:38:17,935 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-26 20:38:17,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-10-26 20:38:17,981 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:38:17,982 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:38:17,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:38:17,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:38:17,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:38:17,983 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:38:17,983 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:38:17,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:38:17,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:38:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-10-26 20:38:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:38:18,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:38:18,009 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] [2018-10-26 20:38:18,011 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:38:18,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:38:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1836001814, now seen corresponding path program 1 times [2018-10-26 20:38:18,020 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:38:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-10-26 20:38:18,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:38:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:38:18,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:38:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:38:18,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:38:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:38:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:38:18,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:38:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:38:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:38:18,214 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-10-26 20:38:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:38:18,341 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2018-10-26 20:38:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:38:18,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-26 20:38:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:38:18,354 INFO L225 Difference]: With dead ends: 78 [2018-10-26 20:38:18,354 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 20:38:18,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-26 20:38:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 20:38:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-10-26 20:38:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 20:38:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-10-26 20:38:18,394 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2018-10-26 20:38:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:38:18,394 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-10-26 20:38:18,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:38:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-10-26 20:38:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:38:18,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:38:18,396 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] [2018-10-26 20:38:18,396 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:38:18,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:38:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1751306001, now seen corresponding path program 1 times [2018-10-26 20:38:18,397 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:38:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-10-26 20:38:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-10-26 20:38:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:38:18,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:38:19,262 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 20:38:20,088 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 20:38:22,137 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq ((_ to_fp 11 53) RNE main_~main__D~0) ((_ to_fp 11 53) RNE 16.0)) (= c_main_~main__Y~0 (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) main_~main__D~0)))) is different from true [2018-10-26 20:38:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:38:22,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:38:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:38:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:38:22,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:38:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:38:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-10-26 20:38:22,916 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 6 states. [2018-10-26 20:38:28,442 WARN L179 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 20:38:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:38:32,537 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-10-26 20:38:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:38:32,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-26 20:38:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:38:32,544 INFO L225 Difference]: With dead ends: 74 [2018-10-26 20:38:32,544 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 20:38:32,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2018-10-26 20:38:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 20:38:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-26 20:38:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 20:38:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-10-26 20:38:32,553 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 20 [2018-10-26 20:38:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:38:32,554 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-10-26 20:38:32,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:38:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-10-26 20:38:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:38:32,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:38:32,555 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] [2018-10-26 20:38:32,556 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:38:32,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:38:32,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1003312673, now seen corresponding path program 1 times [2018-10-26 20:38:32,556 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:38:32,557 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-10-26 20:38:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:38:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:38:32,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:38:33,253 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:38:33,915 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:38:35,070 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:38:38,694 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 20:38:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:38:39,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:38:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:38:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:38:39,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:38:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:38:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:38:39,893 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 7 states. [2018-10-26 20:38:44,935 WARN L179 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 20:38:53,304 WARN L179 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:39:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:05,537 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2018-10-26 20:39:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:39:05,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-10-26 20:39:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:05,544 INFO L225 Difference]: With dead ends: 87 [2018-10-26 20:39:05,544 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:39:05,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:39:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:39:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2018-10-26 20:39:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 20:39:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-10-26 20:39:05,556 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 21 [2018-10-26 20:39:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:05,556 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-10-26 20:39:05,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:39:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-10-26 20:39:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:39:05,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:05,557 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] [2018-10-26 20:39:05,558 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:05,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1090927289, now seen corresponding path program 1 times [2018-10-26 20:39:05,559 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:39:05,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-10-26 20:39:05,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:05,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:06,704 WARN L179 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:39:07,448 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:39:09,357 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:39:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:09,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:39:09,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:09,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:39:09,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:39:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:39:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:39:09,493 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 6 states. [2018-10-26 20:39:15,675 WARN L179 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:39:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:28,018 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-10-26 20:39:28,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:39:28,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-26 20:39:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:28,025 INFO L225 Difference]: With dead ends: 95 [2018-10-26 20:39:28,025 INFO L226 Difference]: Without dead ends: 70 [2018-10-26 20:39:28,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:39:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-26 20:39:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2018-10-26 20:39:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 20:39:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-10-26 20:39:28,035 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 21 [2018-10-26 20:39:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:28,036 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-10-26 20:39:28,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:39:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-10-26 20:39:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:39:28,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:28,037 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] [2018-10-26 20:39:28,037 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:28,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 684080073, now seen corresponding path program 1 times [2018-10-26 20:39:28,038 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:39:28,038 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-10-26 20:39:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:28,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:28,574 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-26 20:39:29,715 WARN L179 SmtUtils]: Spent 748.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:39:31,373 WARN L179 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:39:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:31,391 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:39:31,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:31,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:39:31,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:39:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:39:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:39:31,406 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 5 states. [2018-10-26 20:39:35,178 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 20:39:38,682 WARN L179 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:39:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:56,672 INFO L93 Difference]: Finished difference Result 141 states and 184 transitions. [2018-10-26 20:39:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:39:56,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-26 20:39:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:56,690 INFO L225 Difference]: With dead ends: 141 [2018-10-26 20:39:56,691 INFO L226 Difference]: Without dead ends: 116 [2018-10-26 20:39:56,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:39:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-26 20:39:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 58. [2018-10-26 20:39:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 20:39:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2018-10-26 20:39:56,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 21 [2018-10-26 20:39:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:56,708 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-10-26 20:39:56,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:39:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2018-10-26 20:39:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:39:56,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:56,710 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-10-26 20:39:56,710 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2006409081, now seen corresponding path program 1 times [2018-10-26 20:39:56,711 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:39:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-10-26 20:39:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-10-26 20:39:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:56,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:57,606 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:39:58,374 WARN L179 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:39:59,463 WARN L179 SmtUtils]: Spent 496.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:40:01,136 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:40:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:03,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:40:03,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:40:03,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:40:03,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:40:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:40:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:40:03,533 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand 7 states. [2018-10-26 20:40:10,884 WARN L179 SmtUtils]: Spent 3.40 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:40:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:40:21,577 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2018-10-26 20:40:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:40:21,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-26 20:40:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:40:21,586 INFO L225 Difference]: With dead ends: 107 [2018-10-26 20:40:21,586 INFO L226 Difference]: Without dead ends: 72 [2018-10-26 20:40:21,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:40:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-26 20:40:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-10-26 20:40:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 20:40:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-10-26 20:40:21,596 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2018-10-26 20:40:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:40:21,596 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-10-26 20:40:21,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:40:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-10-26 20:40:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:40:21,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:40:21,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:40:21,598 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:40:21,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:40:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 362136190, now seen corresponding path program 1 times [2018-10-26 20:40:21,599 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:40:21,599 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/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-10-26 20:40:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:40:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:21,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:40:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:21,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:40:21,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:40:21,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:40:21,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:40:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:40:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:40:21,786 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 3 states. [2018-10-26 20:40:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:40:21,862 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2018-10-26 20:40:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:40:21,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 20:40:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:40:21,864 INFO L225 Difference]: With dead ends: 74 [2018-10-26 20:40:21,864 INFO L226 Difference]: Without dead ends: 42 [2018-10-26 20:40:21,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:40:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-26 20:40:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-26 20:40:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-26 20:40:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-10-26 20:40:21,877 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 34 [2018-10-26 20:40:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:40:21,877 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-10-26 20:40:21,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:40:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-10-26 20:40:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:40:21,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:40:21,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:40:21,879 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:40:21,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:40:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1525173959, now seen corresponding path program 1 times [2018-10-26 20:40:21,881 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:40:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-10-26 20:40:21,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:40:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:22,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:40:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:22,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:40:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:40:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:40:22,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:40:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:40:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:40:22,064 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 3 states. [2018-10-26 20:40:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:40:22,225 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-10-26 20:40:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:40:22,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 20:40:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:40:22,227 INFO L225 Difference]: With dead ends: 65 [2018-10-26 20:40:22,227 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 20:40:22,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:40:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 20:40:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 20:40:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 20:40:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-26 20:40:22,237 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 34 [2018-10-26 20:40:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:40:22,237 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-26 20:40:22,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:40:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-26 20:40:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:40:22,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:40:22,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:40:22,240 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:40:22,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:40:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 15701630, now seen corresponding path program 1 times [2018-10-26 20:40:22,240 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:40:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/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-10-26 20:40:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:40:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:22,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:40:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:22,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:40:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:40:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:40:22,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:40:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:40:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:40:22,420 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2018-10-26 20:40:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:40:22,708 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-26 20:40:22,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:40:22,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-26 20:40:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:40:22,709 INFO L225 Difference]: With dead ends: 64 [2018-10-26 20:40:22,709 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:40:22,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:40:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:40:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-10-26 20:40:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 20:40:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-10-26 20:40:22,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2018-10-26 20:40:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:40:22,721 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-10-26 20:40:22,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:40:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-10-26 20:40:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 20:40:22,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:40:22,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:40:22,723 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:40:22,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:40:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 31758979, now seen corresponding path program 1 times [2018-10-26 20:40:22,726 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:40:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-10-26 20:40:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:40:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:22,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:40:23,577 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:40:24,555 WARN L179 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:40:25,583 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:40:27,038 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 20:40:35,534 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:40:40,437 WARN L179 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:40:44,378 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:40:47,065 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE v_prenex_1))) (and (fp.leq .cse0 .cse1) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (fp.leq v_prenex_2 (fp.neg v_prenex_1)) (fp.geq .cse0 (_ +zero 11 53)) (= (fp.sub RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_1) main_~main__D~0) c_main_~main__Y~0)))) is different from true [2018-10-26 20:40:53,131 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE v_prenex_1))) (and (fp.leq .cse0 .cse1) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (fp.leq v_prenex_2 (fp.neg v_prenex_1)) (fp.geq .cse0 (_ +zero 11 53)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_1) main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0))))))) is different from false [2018-10-26 20:40:55,153 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE v_prenex_1))) (and (fp.leq .cse0 .cse1) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (fp.leq v_prenex_2 (fp.neg v_prenex_1)) (fp.geq .cse0 (_ +zero 11 53)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_1) main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0))))))) is different from true [2018-10-26 20:41:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:07,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:41:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:41:07,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 20:41:07,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:41:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:41:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=61, Unknown=3, NotChecked=34, Total=132 [2018-10-26 20:41:07,341 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 12 states. [2018-10-26 20:41:13,230 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 20:41:30,250 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE v_prenex_1))) (and (fp.leq .cse1 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse1 (_ +zero 11 53)) (= c_main_~main__S~0 (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_1)) (fp.leq main_~main__R~0 (fp.neg v_prenex_1))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) RNE 16.0)) (.cse4 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse2 ((_ to_fp 11 53) RNE v_prenex_1))) (and (fp.leq .cse2 .cse3) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse4 .cse3) (fp.geq .cse4 (_ +zero 11 53)) (fp.leq v_prenex_2 (fp.neg v_prenex_1)) (fp.geq .cse2 (_ +zero 11 53)) (= (fp.sub RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_1) main_~main__D~0) c_main_~main__Y~0)))) (fp.geq .cse0 (_ +zero 11 53)))) is different from false [2018-10-26 20:41:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:41:40,010 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-10-26 20:41:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:41:40,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-10-26 20:41:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:41:40,036 INFO L225 Difference]: With dead ends: 82 [2018-10-26 20:41:40,036 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 20:41:40,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=43, Invalid=75, Unknown=4, NotChecked=60, Total=182 [2018-10-26 20:41:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 20:41:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2018-10-26 20:41:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 20:41:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-10-26 20:41:40,058 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2018-10-26 20:41:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:41:40,059 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-26 20:41:40,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:41:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-10-26 20:41:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 20:41:40,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:41:40,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:41:40,066 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:41:40,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:41:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 4618079, now seen corresponding path program 1 times [2018-10-26 20:41:40,066 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:41:40,066 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-10-26 20:41:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-10-26 20:41:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:40,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:41:40,612 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-26 20:41:42,115 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:41:44,533 WARN L179 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:41:48,157 WARN L179 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:41:57,644 WARN L179 SmtUtils]: Spent 4.75 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:42:10,233 WARN L179 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:42:32,090 WARN L179 SmtUtils]: Spent 7.56 s on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 20:43:04,888 WARN L179 SmtUtils]: Spent 17.09 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-26 20:43:08,240 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse2 (fp.sub RNE main_~main__X~0 main_~main__S~0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse1 ((_ to_fp 11 53) RNE 128.0)) (.cse4 ((_ to_fp 11 53) RNE main_~main__S~0)) (.cse5 ((_ to_fp 11 53) RNE 129.0))) (and (fp.leq .cse0 .cse1) (not (fp.leq .cse2 (fp.neg main_~main__D~0))) (fp.leq .cse3 ((_ to_fp 11 53) RNE 16.0)) (= c_main_~main__Y~0 (fp.add RNE main_~main__S~0 main_~main__D~0)) (fp.leq .cse4 .cse5) (fp.geq .cse2 main_~main__D~0) (fp.geq .cse3 (_ +zero 11 53)) (fp.geq .cse0 (fp.neg .cse1)) (fp.geq .cse4 (fp.neg .cse5))))) is different from true [2018-10-26 20:43:14,370 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) RNE 129.0))) (let ((.cse2 (fp.sub RNE main_~main__X~0 main_~main__S~0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse1 ((_ to_fp 11 53) RNE 128.0)) (.cse4 ((_ to_fp 11 53) RNE main_~main__S~0)) (.cse6 (fp.neg .cse5))) (and (fp.leq .cse0 .cse1) (not (fp.leq .cse2 (fp.neg main_~main__D~0))) (fp.leq .cse3 ((_ to_fp 11 53) RNE 16.0)) (fp.leq .cse4 .cse5) (fp.geq .cse2 main_~main__D~0) (fp.geq .cse3 (_ +zero 11 53)) (fp.geq .cse0 (fp.neg .cse1)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.add RNE main_~main__S~0 main_~main__D~0)) .cse6)) (fp.geq .cse4 .cse6))))) is different from false [2018-10-26 20:43:16,405 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) RNE 129.0))) (let ((.cse2 (fp.sub RNE main_~main__X~0 main_~main__S~0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse1 ((_ to_fp 11 53) RNE 128.0)) (.cse4 ((_ to_fp 11 53) RNE main_~main__S~0)) (.cse6 (fp.neg .cse5))) (and (fp.leq .cse0 .cse1) (not (fp.leq .cse2 (fp.neg main_~main__D~0))) (fp.leq .cse3 ((_ to_fp 11 53) RNE 16.0)) (fp.leq .cse4 .cse5) (fp.geq .cse2 main_~main__D~0) (fp.geq .cse3 (_ +zero 11 53)) (fp.geq .cse0 (fp.neg .cse1)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.add RNE main_~main__S~0 main_~main__D~0)) .cse6)) (fp.geq .cse4 .cse6))))) is different from true [2018-10-26 20:43:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:43:28,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:43:28,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:43:28,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 20:43:28,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:43:28,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:43:28,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=52, Unknown=9, NotChecked=34, Total=132 [2018-10-26 20:43:28,647 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 12 states. [2018-10-26 20:43:41,769 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) RNE 129.0))) (let ((.cse3 ((_ to_fp 11 53) RNE c_main_~main__Y~0)) (.cse2 ((_ to_fp 11 53) RNE c_main_~main__D~0)) (.cse0 ((_ to_fp 11 53) RNE c_main_~main__X~0)) (.cse1 ((_ to_fp 11 53) RNE 128.0)) (.cse5 ((_ to_fp 11 53) RNE c_main_~main__S~0)) (.cse4 (fp.neg .cse6))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.leq .cse3 .cse6) (fp.geq .cse2 (_ +zero 11 53)) (fp.geq .cse0 (fp.neg .cse1)) (exists ((main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse8 ((_ to_fp 11 53) RNE 128.0))) (and (fp.leq .cse7 .cse8) (= c_main_~main__R~0 (fp.sub RNE main_~main__X~0 c_main_~main__S~0)) (fp.geq .cse7 (fp.neg .cse8))))) (fp.geq .cse5 .cse4)))) is different from false [2018-10-26 20:44:04,845 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0)) (.cse1 ((_ to_fp 11 53) RNE c_main_~main__S~0)) (.cse2 ((_ to_fp 11 53) RNE 129.0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.leq .cse1 .cse2) (fp.geq .cse0 (_ +zero 11 53)) (exists ((main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse4 ((_ to_fp 11 53) RNE 128.0))) (and (fp.leq .cse3 .cse4) (= c_main_~main__R~0 (fp.sub RNE main_~main__X~0 c_main_~main__S~0)) (fp.geq .cse3 (fp.neg .cse4))))) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse7 (fp.sub RNE main_~main__X~0 main_~main__S~0)) (.cse8 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse5 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse6 ((_ to_fp 11 53) RNE 128.0)) (.cse9 ((_ to_fp 11 53) RNE main_~main__S~0)) (.cse10 ((_ to_fp 11 53) RNE 129.0))) (and (fp.leq .cse5 .cse6) (not (fp.leq .cse7 (fp.neg main_~main__D~0))) (fp.leq .cse8 ((_ to_fp 11 53) RNE 16.0)) (= c_main_~main__Y~0 (fp.add RNE main_~main__S~0 main_~main__D~0)) (fp.leq .cse9 .cse10) (fp.geq .cse7 main_~main__D~0) (fp.geq .cse8 (_ +zero 11 53)) (fp.geq .cse5 (fp.neg .cse6)) (fp.geq .cse9 (fp.neg .cse10))))) (fp.geq .cse1 (fp.neg .cse2)) (not (fp.leq c_main_~main__R~0 (fp.neg c_main_~main__D~0))))) is different from false [2018-10-26 20:44:18,423 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 129.0))) (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0)) (.cse2 ((_ to_fp 11 53) RNE c_main_~main__S~0)) (.cse1 (fp.neg .cse3))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq ((_ to_fp 11 53) RNE c_main_~main__Y~0) .cse1) (fp.leq .cse2 .cse3) (fp.geq .cse0 (_ +zero 11 53)) (exists ((main_~main__X~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) RNE main_~main__X~0)) (.cse5 ((_ to_fp 11 53) RNE 128.0))) (and (fp.leq .cse4 .cse5) (= c_main_~main__R~0 (fp.sub RNE main_~main__X~0 c_main_~main__S~0)) (fp.geq .cse4 (fp.neg .cse5))))) (fp.geq .cse2 .cse1) (not (fp.leq c_main_~main__R~0 (fp.neg c_main_~main__D~0)))))) is different from false [2018-10-26 20:44:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:44:29,581 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-10-26 20:44:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:44:29,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-10-26 20:44:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:44:29,595 INFO L225 Difference]: With dead ends: 95 [2018-10-26 20:44:29,595 INFO L226 Difference]: Without dead ends: 93 [2018-10-26 20:44:29,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 99.7s TimeCoverageRelationStatistics Valid=43, Invalid=55, Unknown=12, NotChecked=100, Total=210 [2018-10-26 20:44:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-26 20:44:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-10-26 20:44:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-26 20:44:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-10-26 20:44:29,617 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 35 [2018-10-26 20:44:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:44:29,618 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-10-26 20:44:29,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:44:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-10-26 20:44:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 20:44:29,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:44:29,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:44:29,620 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:44:29,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:44:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash 496280823, now seen corresponding path program 1 times [2018-10-26 20:44:29,620 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:44:29,620 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-10-26 20:44:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:44:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:44:29,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:44:30,176 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-10-26 20:44:33,138 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 20:44:36,755 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:44:41,560 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:44:44,157 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse0 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))) is different from true [2018-10-26 20:44:46,181 WARN L832 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) RNE c_main_~main__Y~0) (fp.neg ((_ to_fp 11 53) RNE 129.0))) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse0 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0)))))) is different from false [2018-10-26 20:44:52,325 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 ((_ to_fp 11 53) RNE (fp.sub RNE main_~main__S~0 main_~main__D~0))) (.cse2 ((_ to_fp 11 53) RNE 129.0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) .cse2) (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse1 .cse2))))) is different from false [2018-10-26 20:44:54,349 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 ((_ to_fp 11 53) RNE (fp.sub RNE main_~main__S~0 main_~main__D~0))) (.cse2 ((_ to_fp 11 53) RNE 129.0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) .cse2) (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse1 .cse2))))) is different from true [2018-10-26 20:45:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:45:06,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:45:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:45:06,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:45:06,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:45:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:45:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=20, Unknown=4, NotChecked=30, Total=72 [2018-10-26 20:45:06,506 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 9 states. [2018-10-26 20:45:22,834 WARN L179 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:45:34,387 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse0 (_ +zero 11 53)) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse1 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse1 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))))) is different from false [2018-10-26 20:45:36,414 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse0 (_ +zero 11 53)) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse1 ((_ to_fp 11 53) RNE 16.0)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 129.0)) (fp.geq .cse1 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))))) is different from true [2018-10-26 20:45:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:45:45,190 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-10-26 20:45:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:45:45,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-26 20:45:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:45:45,199 INFO L225 Difference]: With dead ends: 138 [2018-10-26 20:45:45,199 INFO L226 Difference]: Without dead ends: 136 [2018-10-26 20:45:45,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=26, Invalid=26, Unknown=6, NotChecked=52, Total=110 [2018-10-26 20:45:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-26 20:45:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-10-26 20:45:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-26 20:45:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-10-26 20:45:45,226 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-10-26 20:45:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:45:45,226 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-10-26 20:45:45,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:45:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-10-26 20:45:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 20:45:45,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:45:45,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:45:45,227 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:45:45,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:45:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -719670053, now seen corresponding path program 1 times [2018-10-26 20:45:45,228 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:45:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/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-10-26 20:45:45,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:45:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:45:45,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:45:45,914 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:45:46,877 WARN L179 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:45:48,144 WARN L179 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:45:50,143 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:45:55,998 WARN L179 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 20:45:59,402 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:46:02,336 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:46:05,193 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_3)) (.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (= (fp.sub RNE (fp.add RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_3) main_~main__D~0) c_main_~main__Y~0) (fp.geq .cse2 (_ +zero 11 53)) (fp.geq v_prenex_4 v_prenex_3)))) is different from true [2018-10-26 20:46:11,252 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_3)) (.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE (fp.add RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_3) main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0)))) (fp.geq v_prenex_4 v_prenex_3)))) is different from false [2018-10-26 20:46:13,268 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_3)) (.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse2 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE (fp.add RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_3) main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0)))) (fp.geq v_prenex_4 v_prenex_3)))) is different from true [2018-10-26 20:46:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:46:25,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:46:25,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:46:25,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 20:46:25,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:46:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:46:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=61, Unknown=3, NotChecked=34, Total=132 [2018-10-26 20:46:25,430 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 12 states. [2018-10-26 20:46:32,455 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 20:46:46,773 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (exists ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE v_prenex_3)) (.cse2 ((_ to_fp 11 53) RNE 16.0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (fp.leq .cse3 .cse2) (= (fp.sub RNE (fp.add RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_3) main_~main__D~0) c_main_~main__Y~0) (fp.geq .cse3 (_ +zero 11 53)) (fp.geq v_prenex_4 v_prenex_3)))) (fp.geq .cse0 (_ +zero 11 53)) (exists ((v_prenex_3 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) RNE v_prenex_3))) (and (fp.leq .cse4 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse4 (_ +zero 11 53)) (fp.geq main_~main__R~0 v_prenex_3) (= c_main_~main__S~0 (fp.add RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_3))))))) is different from false [2018-10-26 20:46:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:46:53,907 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-10-26 20:46:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:46:53,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-10-26 20:46:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:46:53,925 INFO L225 Difference]: With dead ends: 150 [2018-10-26 20:46:53,926 INFO L226 Difference]: Without dead ends: 148 [2018-10-26 20:46:53,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=43, Invalid=75, Unknown=4, NotChecked=60, Total=182 [2018-10-26 20:46:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-26 20:46:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2018-10-26 20:46:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-26 20:46:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-10-26 20:46:53,955 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-10-26 20:46:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:46:53,956 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-10-26 20:46:53,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:46:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-10-26 20:46:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 20:46:53,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:46:53,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:46:53,957 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:46:53,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:46:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -296968227, now seen corresponding path program 1 times [2018-10-26 20:46:53,958 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:46:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-10-26 20:46:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:46:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:46:54,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:46:54,929 WARN L179 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 20:46:55,790 WARN L179 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:46:59,317 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 20:47:04,412 WARN L179 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:47:08,861 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 20:47:17,440 WARN L179 SmtUtils]: Spent 5.66 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-26 20:47:22,748 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 20:47:38,260 WARN L179 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 20:47:48,655 WARN L179 SmtUtils]: Spent 3.44 s on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 20:48:03,882 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 20:48:05,904 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 ((_ to_fp 11 53) RNE 16.0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse1 v_prenex_5)) (fp.leq .cse0 .cse2) (fp.leq .cse3 .cse2) (fp.geq .cse3 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse1 (fp.neg v_prenex_5))) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))) is different from false [2018-10-26 20:48:07,922 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 ((_ to_fp 11 53) RNE 16.0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse1 v_prenex_5)) (fp.leq .cse0 .cse2) (fp.leq .cse3 .cse2) (fp.geq .cse3 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse1 (fp.neg v_prenex_5))) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))) is different from true [2018-10-26 20:48:14,001 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 ((_ to_fp 11 53) RNE 16.0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse1 v_prenex_5)) (fp.leq .cse0 .cse2) (fp.leq .cse3 .cse2) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE main_~main__S~0 main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0)))) (fp.geq .cse3 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse1 (fp.neg v_prenex_5)))))) is different from false [2018-10-26 20:48:16,025 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 ((_ to_fp 11 53) RNE 16.0)) (.cse3 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse1 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse1 v_prenex_5)) (fp.leq .cse0 .cse2) (fp.leq .cse3 .cse2) (not (fp.geq ((_ to_fp 11 53) RNE (fp.sub RNE main_~main__S~0 main_~main__D~0)) (fp.neg ((_ to_fp 11 53) RNE 129.0)))) (fp.geq .cse3 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse1 (fp.neg v_prenex_5)))))) is different from true [2018-10-26 20:48:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:48:28,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:48:28,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:48:28,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 20:48:28,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:48:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:48:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=111, Unknown=4, NotChecked=46, Total=210 [2018-10-26 20:48:28,245 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 15 states. [2018-10-26 20:48:58,370 WARN L179 SmtUtils]: Spent 13.21 s on a formula simplification that was a NOOP. DAG size: 36 [2018-10-26 20:49:29,406 WARN L179 SmtUtils]: Spent 14.06 s on a formula simplification that was a NOOP. DAG size: 37 [2018-10-26 20:49:34,997 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0)) (.cse1 ((_ to_fp 11 53) RNE 128.0))) (and (= c_main_~main__R~0 (fp.sub RNE c_main_~main__Y~0 ((_ to_fp 8 24) RNE (_ bv0 32)))) (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__S~0) .cse1) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__Y~0) .cse1) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse3 (fp.sub RNE c_main_~main__Y~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse2 (_ +zero 11 53)) (fp.leq .cse2 ((_ to_fp 11 53) RNE 16.0)) (not (fp.leq .cse3 (fp.neg v_prenex_5))) (not (fp.geq .cse3 v_prenex_5))))) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse5 (fp.sub RNE c_main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse4 (_ +zero 11 53)) (not (fp.geq .cse5 v_prenex_5)) (fp.leq .cse4 ((_ to_fp 11 53) RNE 16.0)) (not (fp.leq .cse5 (fp.neg v_prenex_5)))))) (not (fp.leq c_main_~main__R~0 (fp.neg c_main_~main__D~0))))) is different from false [2018-10-26 20:50:23,009 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 (fp.sub RNE c_main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse1 (_ +zero 11 53)) (not (fp.geq .cse2 v_prenex_5)) (fp.leq .cse1 ((_ to_fp 11 53) RNE 16.0)) (not (fp.leq .cse2 (fp.neg v_prenex_5)))))) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse5 ((_ to_fp 11 53) RNE 16.0)) (.cse6 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse4 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse3 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse4 v_prenex_5)) (fp.leq .cse3 .cse5) (fp.leq .cse6 .cse5) (fp.geq .cse6 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse4 (fp.neg v_prenex_5))) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))))) is different from false [2018-10-26 20:50:25,037 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE c_main_~main__D~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 16.0)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE c_main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse2 (fp.sub RNE c_main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse1 (_ +zero 11 53)) (not (fp.geq .cse2 v_prenex_5)) (fp.leq .cse1 ((_ to_fp 11 53) RNE 16.0)) (not (fp.leq .cse2 (fp.neg v_prenex_5)))))) (exists ((main_~main__S~0 (_ FloatingPoint 8 24)) (v_prenex_5 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) RNE v_prenex_5)) (.cse5 ((_ to_fp 11 53) RNE 16.0)) (.cse6 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse4 (fp.sub RNE main_~main__S~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (and (fp.geq .cse3 (_ +zero 11 53)) (fp.leq main_~main__R~0 (fp.neg main_~main__D~0)) (not (fp.geq .cse4 v_prenex_5)) (fp.leq .cse3 .cse5) (fp.leq .cse6 .cse5) (fp.geq .cse6 (_ +zero 11 53)) (fp.leq ((_ to_fp 11 53) RNE main_~main__S~0) ((_ to_fp 11 53) RNE 128.0)) (not (fp.leq .cse4 (fp.neg v_prenex_5))) (= c_main_~main__Y~0 (fp.sub RNE main_~main__S~0 main_~main__D~0))))))) is different from true [2018-10-26 20:50:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:43,730 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-10-26 20:50:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 20:50:43,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-10-26 20:50:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:43,755 INFO L225 Difference]: With dead ends: 150 [2018-10-26 20:50:43,755 INFO L226 Difference]: Without dead ends: 148 [2018-10-26 20:50:43,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 129.8s TimeCoverageRelationStatistics Valid=63, Invalid=154, Unknown=9, NotChecked=116, Total=342 [2018-10-26 20:50:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-26 20:50:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2018-10-26 20:50:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-26 20:50:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2018-10-26 20:50:43,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 35 [2018-10-26 20:50:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:43,784 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2018-10-26 20:50:43,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:50:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2018-10-26 20:50:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 20:50:43,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:43,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:50:43,785 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:43,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash -345087077, now seen corresponding path program 1 times [2018-10-26 20:50:43,785 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-10-26 20:50:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_975a54f9-aa9d-4592-b44b-d6af8da74d9a/bin-2019/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-10-26 20:50:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:43,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:50:44,573 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:50:45,815 WARN L179 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:50:46,870 WARN L179 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:50:48,118 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 20:50:56,554 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:51:00,680 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:51:05,874 WARN L179 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:51:08,468 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (v_prenex_7 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse2 ((_ to_fp 11 53) RNE v_prenex_6))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq v_prenex_7 (fp.neg v_prenex_6)) (fp.geq .cse2 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.add RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_6) main_~main__D~0)) (fp.geq main_~main__R~0 main_~main__D~0)))) is different from true [2018-10-26 20:51:12,052 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) RNE c_main_~main__Y~0) (fp.neg ((_ to_fp 11 53) RNE 129.0))) (exists ((v_prenex_6 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (v_prenex_7 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse2 ((_ to_fp 11 53) RNE v_prenex_6))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq v_prenex_7 (fp.neg v_prenex_6)) (fp.geq .cse2 (_ +zero 11 53)) (= c_main_~main__Y~0 (fp.add RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_6) main_~main__D~0)) (fp.geq main_~main__R~0 main_~main__D~0))))) is different from true [2018-10-26 20:51:18,177 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (v_prenex_7 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse3 ((_ to_fp 11 53) RNE (fp.add RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_6) main_~main__D~0))) (.cse4 ((_ to_fp 11 53) RNE 129.0)) (.cse2 ((_ to_fp 11 53) RNE v_prenex_6))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq v_prenex_7 (fp.neg v_prenex_6)) (not (fp.leq .cse3 .cse4)) (fp.geq .cse3 (fp.neg .cse4)) (fp.geq .cse2 (_ +zero 11 53)) (fp.geq main_~main__R~0 main_~main__D~0)))) is different from false [2018-10-26 20:51:20,201 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ FloatingPoint 8 24)) (main_~main__D~0 (_ FloatingPoint 8 24)) (v_prenex_7 (_ FloatingPoint 8 24)) (main_~main__R~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) RNE 16.0)) (.cse0 ((_ to_fp 11 53) RNE main_~main__D~0)) (.cse3 ((_ to_fp 11 53) RNE (fp.add RNE (fp.sub RNE ((_ to_fp 8 24) RNE (_ bv0 32)) v_prenex_6) main_~main__D~0))) (.cse4 ((_ to_fp 11 53) RNE 129.0)) (.cse2 ((_ to_fp 11 53) RNE v_prenex_6))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq v_prenex_7 (fp.neg v_prenex_6)) (not (fp.leq .cse3 .cse4)) (fp.geq .cse3 (fp.neg .cse4)) (fp.geq .cse2 (_ +zero 11 53)) (fp.geq main_~main__R~0 main_~main__D~0)))) is different from true [2018-10-26 20:51:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:51:32,350 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:51:32,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:32,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 20:51:32,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:51:32,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:51:32,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=62, Unknown=4, NotChecked=54, Total=156 [2018-10-26 20:51:32,360 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 13 states. [2018-10-26 20:51:38,168 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 20:51:53,288 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:689) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-10-26 20:51:53,292 INFO L168 Benchmark]: Toolchain (without parser) took 818429.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 951.9 MB in the beginning and 833.4 MB in the end (delta: 118.5 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:53,292 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:53,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:53,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:53,293 INFO L168 Benchmark]: Boogie Preprocessor took 27.24 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:51:53,293 INFO L168 Benchmark]: RCFGBuilder took 2707.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:53,293 INFO L168 Benchmark]: TraceAbstraction took 815383.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 833.4 MB in the end (delta: 292.1 MB). Peak memory consumption was 343.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:51:53,307 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.21 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 280.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.24 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2707.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 815383.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 833.4 MB in the end (delta: 292.1 MB). Peak memory consumption was 343.5 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...