./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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 e6812207659d67444abdc9d105ff32acac8458b5 ........................................................................................................................................................................... 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_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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 e6812207659d67444abdc9d105ff32acac8458b5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:01:36,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:01:36,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:01:36,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:01:36,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:01:36,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:01:36,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:01:36,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:01:36,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:01:36,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:01:36,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:01:36,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:01:36,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:01:36,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:01:36,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:01:36,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:01:36,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:01:36,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:01:36,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:01:36,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:01:36,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:01:36,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:01:36,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:01:36,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:01:36,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:01:36,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:01:36,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:01:36,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:01:36,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:01:36,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:01:36,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:01:36,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:01:36,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:01:36,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:01:36,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:01:36,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:01:36,096 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 02:01:36,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:01:36,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:01:36,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:01:36,104 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:01:36,104 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:01:36,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:01:36,104 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:01:36,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:01:36,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:01:36,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:01:36,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:01:36,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:01:36,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:01:36,107 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_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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 -> e6812207659d67444abdc9d105ff32acac8458b5 [2018-12-02 02:01:36,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:01:36,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:01:36,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:01:36,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:01:36,134 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:01:36,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-12-02 02:01:36,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/3cb5e65be/c23ec299fdce44bc9e20d777c9f13676/FLAG3d2902562 [2018-12-02 02:01:36,680 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:01:36,680 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-12-02 02:01:36,685 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/3cb5e65be/c23ec299fdce44bc9e20d777c9f13676/FLAG3d2902562 [2018-12-02 02:01:37,158 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/3cb5e65be/c23ec299fdce44bc9e20d777c9f13676 [2018-12-02 02:01:37,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:01:37,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:01:37,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:01:37,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:01:37,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:01:37,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:01:37" (1/1) ... [2018-12-02 02:01:37,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e485762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:37, skipping insertion in model container [2018-12-02 02:01:37,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:01:37" (1/1) ... [2018-12-02 02:01:37,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:01:37,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:01:37,332 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:834) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1660) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$35(StandardFunctionHandler.java:315) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:208) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:539) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1897) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1513) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:963) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1490) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:963) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1342) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3446) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2241) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:539) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:190) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) 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) [2018-12-02 02:01:37,334 INFO L168 Benchmark]: Toolchain (without parser) took 173.77 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 941.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:01:37,335 INFO L168 Benchmark]: CDTParser took 0.11 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-12-02 02:01:37,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:01:37,336 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.11 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 172.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:834) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:01:38,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:01:38,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:01:38,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:01:38,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:01:38,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:01:38,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:01:38,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:01:38,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:01:38,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:01:38,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:01:38,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:01:38,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:01:38,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:01:38,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:01:38,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:01:38,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:01:38,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:01:38,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:01:38,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:01:38,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:01:38,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:01:38,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:01:38,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:01:38,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:01:38,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:01:38,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:01:38,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:01:38,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:01:38,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:01:38,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:01:38,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:01:38,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:01:38,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:01:38,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:01:38,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:01:38,442 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 02:01:38,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:01:38,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:01:38,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:01:38,450 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:01:38,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:01:38,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 02:01:38,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:01:38,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:01:38,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 02:01:38,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:01:38,453 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 02:01:38,453 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 02:01:38,453 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_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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 -> e6812207659d67444abdc9d105ff32acac8458b5 [2018-12-02 02:01:38,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:01:38,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:01:38,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:01:38,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:01:38,481 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:01:38,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-12-02 02:01:38,515 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/df828a55f/14b2d510bb5a4b149de5d6c52e699ad2/FLAGbfd6d0efe [2018-12-02 02:01:38,940 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:01:38,940 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/sv-benchmarks/c/float-newlib/double_req_bl_0882_true-unreach-call.c [2018-12-02 02:01:38,947 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/df828a55f/14b2d510bb5a4b149de5d6c52e699ad2/FLAGbfd6d0efe [2018-12-02 02:01:38,955 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/data/df828a55f/14b2d510bb5a4b149de5d6c52e699ad2 [2018-12-02 02:01:38,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:01:38,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:01:38,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:01:38,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:01:38,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:01:38,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:01:38" (1/1) ... [2018-12-02 02:01:38,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748af0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:38, skipping insertion in model container [2018-12-02 02:01:38,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:01:38" (1/1) ... [2018-12-02 02:01:38,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:01:38,997 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:01:39,173 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:01:39,178 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:01:39,270 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:01:39,287 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:01:39,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39 WrapperNode [2018-12-02 02:01:39,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:01:39,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:01:39,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:01:39,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:01:39,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:01:39,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:01:39,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:01:39,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:01:39,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... [2018-12-02 02:01:39,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:01:39,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:01:39,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:01:39,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:01:39,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:01:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-02 02:01:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-12-02 02:01:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-12-02 02:01:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-12-02 02:01:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-12-02 02:01:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-02 02:01:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-12-02 02:01:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-12-02 02:01:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:01:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-12-02 02:01:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-12-02 02:01:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:01:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 02:01:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:01:39,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:01:39,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 02:01:39,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:01:39,572 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:40,533 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:40,976 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:41,889 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:41,909 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:41,926 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:41,939 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:41,960 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:44,108 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:50,412 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:50,524 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:53,212 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:53,230 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:53,667 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:01:53,708 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:05,541 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:06,010 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:06,042 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:08,401 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:08,427 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:10,942 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:13,095 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:15,280 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:15,941 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:15,976 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:15,991 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:16,443 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:20,911 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 02:02:20,917 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:02:20,918 INFO L280 CfgBuilder]: Removed 60 assue(true) statements. [2018-12-02 02:02:20,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:02:20 BoogieIcfgContainer [2018-12-02 02:02:20,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:02:20,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:02:20,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:02:20,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:02:20,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:01:38" (1/3) ... [2018-12-02 02:02:20,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408c236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:02:20, skipping insertion in model container [2018-12-02 02:02:20,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:01:39" (2/3) ... [2018-12-02 02:02:20,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408c236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:02:20, skipping insertion in model container [2018-12-02 02:02:20,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:02:20" (3/3) ... [2018-12-02 02:02:20,922 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0882_true-unreach-call.c [2018-12-02 02:02:20,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:02:20,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:02:20,942 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:02:20,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:02:20,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:02:20,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:02:20,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:02:20,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:02:20,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:02:20,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:02:20,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:02:20,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:02:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states. [2018-12-02 02:02:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:02:20,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:02:20,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:02:20,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:02:20,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:02:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1650283176, now seen corresponding path program 1 times [2018-12-02 02:02:20,984 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:02:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:02:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:02:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:02:21,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:02:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:02:21,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:02:21,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:02:21,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:02:21,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 02:02:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 02:02:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:02:21,183 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 2 states. [2018-12-02 02:02:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:02:21,222 INFO L93 Difference]: Finished difference Result 457 states and 749 transitions. [2018-12-02 02:02:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 02:02:21,223 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-12-02 02:02:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:02:21,231 INFO L225 Difference]: With dead ends: 457 [2018-12-02 02:02:21,231 INFO L226 Difference]: Without dead ends: 228 [2018-12-02 02:02:21,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:02:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-02 02:02:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-12-02 02:02:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-02 02:02:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2018-12-02 02:02:21,266 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 19 [2018-12-02 02:02:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:02:21,267 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2018-12-02 02:02:21,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 02:02:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2018-12-02 02:02:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:02:21,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:02:21,267 INFO L402 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-12-02 02:02:21,268 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:02:21,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:02:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash -166928027, now seen corresponding path program 1 times [2018-12-02 02:02:21,268 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:02:21,268 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-02 02:02:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:02:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:02:21,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:02:21,558 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:21,559 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:21,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-02 02:02:21,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 02:02:21,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:21,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 02:02:21,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-12-02 02:02:21,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:21,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:21,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:21,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:02:21,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-02 02:02:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:02:21,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:02:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:02:21,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:02:21,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:02:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:02:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:02:21,757 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand 7 states. [2018-12-02 02:02:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:02:36,158 INFO L93 Difference]: Finished difference Result 249 states and 333 transitions. [2018-12-02 02:02:36,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:02:36,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-02 02:02:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:02:36,280 INFO L225 Difference]: With dead ends: 249 [2018-12-02 02:02:36,280 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 02:02:36,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:02:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 02:02:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2018-12-02 02:02:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-02 02:02:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2018-12-02 02:02:36,295 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 21 [2018-12-02 02:02:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:02:36,295 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2018-12-02 02:02:36,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:02:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2018-12-02 02:02:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 02:02:36,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:02:36,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:02:36,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:02:36,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:02:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -857621751, now seen corresponding path program 1 times [2018-12-02 02:02:36,297 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:02:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:02:36,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:02:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:02:36,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:02:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:02:36,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:02:36,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:02:36,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:02:36,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:02:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:02:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:02:36,597 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand 7 states. [2018-12-02 02:02:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:02:47,185 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2018-12-02 02:02:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:02:47,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-02 02:02:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:02:47,188 INFO L225 Difference]: With dead ends: 283 [2018-12-02 02:02:47,188 INFO L226 Difference]: Without dead ends: 267 [2018-12-02 02:02:47,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:02:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-02 02:02:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 228. [2018-12-02 02:02:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-02 02:02:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 305 transitions. [2018-12-02 02:02:47,201 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 305 transitions. Word has length 23 [2018-12-02 02:02:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:02:47,201 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 305 transitions. [2018-12-02 02:02:47,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:02:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 305 transitions. [2018-12-02 02:02:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 02:02:47,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:02:47,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:02:47,202 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:02:47,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:02:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 29881930, now seen corresponding path program 1 times [2018-12-02 02:02:47,203 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:02:47,203 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:02:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:02:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:02:47,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:02:47,534 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:47,534 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:47,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-02 02:02:47,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-12-02 02:02:47,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 02:02:47,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-12-02 02:02:47,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:02:47,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2018-12-02 02:02:47,735 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:47,735 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:02:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-12-02 02:02:47,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-12-02 02:02:47,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-02 02:02:47,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 02:02:47,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-02 02:02:47,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:02:47,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:02:47,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:74, output treesize:35 [2018-12-02 02:02:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:02:48,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:02:48,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:02:48,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 02:02:48,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:02:48,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:02:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:02:48,171 INFO L87 Difference]: Start difference. First operand 228 states and 305 transitions. Second operand 9 states. [2018-12-02 02:02:49,082 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-12-02 02:03:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:03:13,893 INFO L93 Difference]: Finished difference Result 252 states and 330 transitions. [2018-12-02 02:03:14,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:03:14,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-02 02:03:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:03:14,020 INFO L225 Difference]: With dead ends: 252 [2018-12-02 02:03:14,021 INFO L226 Difference]: Without dead ends: 236 [2018-12-02 02:03:14,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:03:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-02 02:03:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2018-12-02 02:03:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-02 02:03:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 303 transitions. [2018-12-02 02:03:14,040 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 303 transitions. Word has length 23 [2018-12-02 02:03:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:03:14,041 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 303 transitions. [2018-12-02 02:03:14,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:03:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 303 transitions. [2018-12-02 02:03:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:03:14,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:03:14,042 INFO L402 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] [2018-12-02 02:03:14,042 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:03:14,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:03:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2076363094, now seen corresponding path program 1 times [2018-12-02 02:03:14,043 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:03:14,043 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:03:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:03:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:03:14,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:03:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:03:14,461 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:03:14,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:03:14,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:03:14,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:03:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:03:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:03:14,474 INFO L87 Difference]: Start difference. First operand 227 states and 303 transitions. Second operand 6 states. [2018-12-02 02:03:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:03:28,415 INFO L93 Difference]: Finished difference Result 245 states and 321 transitions. [2018-12-02 02:03:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:03:28,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 02:03:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:03:28,540 INFO L225 Difference]: With dead ends: 245 [2018-12-02 02:03:28,540 INFO L226 Difference]: Without dead ends: 230 [2018-12-02 02:03:28,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:03:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-02 02:03:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-02 02:03:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-02 02:03:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2018-12-02 02:03:28,554 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 27 [2018-12-02 02:03:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:03:28,554 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2018-12-02 02:03:28,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:03:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2018-12-02 02:03:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:03:28,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:03:28,555 INFO L402 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] [2018-12-02 02:03:28,555 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:03:28,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:03:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1951936010, now seen corresponding path program 1 times [2018-12-02 02:03:28,555 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:03:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-02 02:03:28,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:03:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:03:29,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:03:31,732 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:03:34,001 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from true [2018-12-02 02:03:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:03:34,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:03:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:03:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:03:34,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:03:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:03:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=29, Unknown=2, NotChecked=10, Total=56 [2018-12-02 02:03:34,061 INFO L87 Difference]: Start difference. First operand 227 states and 302 transitions. Second operand 8 states. [2018-12-02 02:03:43,781 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= c___ieee754_pow_~x |c___ieee754_pow_#in~x|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:03:46,066 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= c___ieee754_pow_~x |c___ieee754_pow_#in~x|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from true [2018-12-02 02:03:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:03:57,693 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2018-12-02 02:03:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:03:57,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 02:03:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:03:57,695 INFO L225 Difference]: With dead ends: 272 [2018-12-02 02:03:57,695 INFO L226 Difference]: Without dead ends: 269 [2018-12-02 02:03:57,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=22, Invalid=38, Unknown=4, NotChecked=26, Total=90 [2018-12-02 02:03:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-02 02:03:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2018-12-02 02:03:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-02 02:03:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 306 transitions. [2018-12-02 02:03:57,708 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 306 transitions. Word has length 27 [2018-12-02 02:03:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:03:57,709 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 306 transitions. [2018-12-02 02:03:57,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:03:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 306 transitions. [2018-12-02 02:03:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:03:57,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:03:57,710 INFO L402 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] [2018-12-02 02:03:57,710 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:03:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:03:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1455527605, now seen corresponding path program 1 times [2018-12-02 02:03:57,711 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:03:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:03:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:03:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:03:57,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:03:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:03:58,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:03:58,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:03:58,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:03:58,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:03:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:03:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:03:58,017 INFO L87 Difference]: Start difference. First operand 231 states and 306 transitions. Second operand 8 states. [2018-12-02 02:04:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:04:09,866 INFO L93 Difference]: Finished difference Result 248 states and 323 transitions. [2018-12-02 02:04:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:04:09,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 02:04:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:04:09,993 INFO L225 Difference]: With dead ends: 248 [2018-12-02 02:04:09,993 INFO L226 Difference]: Without dead ends: 233 [2018-12-02 02:04:09,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:04:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-02 02:04:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-12-02 02:04:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-02 02:04:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 305 transitions. [2018-12-02 02:04:10,007 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 305 transitions. Word has length 27 [2018-12-02 02:04:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:04:10,008 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 305 transitions. [2018-12-02 02:04:10,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:04:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 305 transitions. [2018-12-02 02:04:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:04:10,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:04:10,008 INFO L402 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] [2018-12-02 02:04:10,008 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:04:10,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:04:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1297315135, now seen corresponding path program 1 times [2018-12-02 02:04:10,009 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:04:10,009 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:04:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:04:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:04:10,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:04:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:04:10,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:04:10,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:04:10,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:04:10,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:04:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:04:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:04:10,322 INFO L87 Difference]: Start difference. First operand 231 states and 305 transitions. Second operand 7 states. [2018-12-02 02:04:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:04:19,569 INFO L93 Difference]: Finished difference Result 347 states and 448 transitions. [2018-12-02 02:04:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:04:19,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 02:04:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:04:19,572 INFO L225 Difference]: With dead ends: 347 [2018-12-02 02:04:19,572 INFO L226 Difference]: Without dead ends: 263 [2018-12-02 02:04:19,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:04:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-02 02:04:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2018-12-02 02:04:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-02 02:04:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-12-02 02:04:19,589 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 29 [2018-12-02 02:04:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:04:19,590 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-12-02 02:04:19,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:04:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-12-02 02:04:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:04:19,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:04:19,590 INFO L402 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] [2018-12-02 02:04:19,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:04:19,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:04:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1799940619, now seen corresponding path program 1 times [2018-12-02 02:04:19,591 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:04:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:04:19,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:04:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:04:19,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:04:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:04:19,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:04:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:04:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:04:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:04:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:04:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:04:19,829 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 7 states. [2018-12-02 02:04:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:04:36,905 INFO L93 Difference]: Finished difference Result 233 states and 300 transitions. [2018-12-02 02:04:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:04:36,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 02:04:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:04:36,907 INFO L225 Difference]: With dead ends: 233 [2018-12-02 02:04:36,907 INFO L226 Difference]: Without dead ends: 230 [2018-12-02 02:04:36,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:04:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-02 02:04:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2018-12-02 02:04:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 02:04:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2018-12-02 02:04:36,926 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 29 [2018-12-02 02:04:36,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:04:36,927 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2018-12-02 02:04:36,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:04:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2018-12-02 02:04:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:04:36,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:04:36,927 INFO L402 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] [2018-12-02 02:04:36,928 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:04:36,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:04:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash -990593993, now seen corresponding path program 1 times [2018-12-02 02:04:36,928 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:04:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:04:36,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:04:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:04:37,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:04:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:04:37,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:04:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:04:37,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:04:37,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:04:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:04:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:04:37,180 INFO L87 Difference]: Start difference. First operand 226 states and 293 transitions. Second operand 6 states. [2018-12-02 02:04:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:04:54,039 INFO L93 Difference]: Finished difference Result 296 states and 379 transitions. [2018-12-02 02:04:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:04:54,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-12-02 02:04:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:04:54,042 INFO L225 Difference]: With dead ends: 296 [2018-12-02 02:04:54,042 INFO L226 Difference]: Without dead ends: 228 [2018-12-02 02:04:54,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:04:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-02 02:04:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 190. [2018-12-02 02:04:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-02 02:04:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 237 transitions. [2018-12-02 02:04:54,057 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 237 transitions. Word has length 29 [2018-12-02 02:04:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:04:54,057 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 237 transitions. [2018-12-02 02:04:54,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:04:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 237 transitions. [2018-12-02 02:04:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 02:04:54,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:04:54,058 INFO L402 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-12-02 02:04:54,059 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:04:54,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:04:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1745994737, now seen corresponding path program 1 times [2018-12-02 02:04:54,059 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:04:54,059 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-02 02:04:54,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:04:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:04:54,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:04:57,273 WARN L832 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:04:59,524 WARN L854 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven c_~one_pow~0 |c___ieee754_pow_#in~x|) |c___ieee754_pow_#res|) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from true [2018-12-02 02:04:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:04:59,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:04:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:04:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 02:04:59,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:04:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:04:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=109, Unknown=2, NotChecked=20, Total=156 [2018-12-02 02:04:59,734 INFO L87 Difference]: Start difference. First operand 190 states and 237 transitions. Second operand 13 states. [2018-12-02 02:05:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:05:17,211 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2018-12-02 02:05:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:05:17,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-12-02 02:05:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:05:17,214 INFO L225 Difference]: With dead ends: 232 [2018-12-02 02:05:17,214 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 02:05:17,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=71, Invalid=311, Unknown=2, NotChecked=36, Total=420 [2018-12-02 02:05:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 02:05:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2018-12-02 02:05:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-02 02:05:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 235 transitions. [2018-12-02 02:05:17,230 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 235 transitions. Word has length 35 [2018-12-02 02:05:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:05:17,230 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 235 transitions. [2018-12-02 02:05:17,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:05:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2018-12-02 02:05:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 02:05:17,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:05:17,231 INFO L402 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-12-02 02:05:17,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:05:17,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:05:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 422241547, now seen corresponding path program 1 times [2018-12-02 02:05:17,231 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:05:17,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:05:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:05:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:05:18,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:05:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:05:18,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:05:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:05:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:05:18,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:05:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:05:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:05:18,289 INFO L87 Difference]: Start difference. First operand 189 states and 235 transitions. Second operand 8 states. [2018-12-02 02:05:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:05:23,976 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2018-12-02 02:05:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:05:23,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-02 02:05:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:05:23,978 INFO L225 Difference]: With dead ends: 242 [2018-12-02 02:05:23,978 INFO L226 Difference]: Without dead ends: 165 [2018-12-02 02:05:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:05:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-02 02:05:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2018-12-02 02:05:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 02:05:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2018-12-02 02:05:23,986 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 36 [2018-12-02 02:05:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:05:23,986 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2018-12-02 02:05:23,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:05:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2018-12-02 02:05:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 02:05:23,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:05:23,987 INFO L402 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, 1] [2018-12-02 02:05:23,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:05:23,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:05:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash 627806428, now seen corresponding path program 1 times [2018-12-02 02:05:23,988 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:05:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:05:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:05:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:05:24,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:05:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:05:24,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:05:24,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:05:24,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 02:05:24,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:05:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:05:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:05:24,370 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand 12 states. [2018-12-02 02:05:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:05:36,693 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2018-12-02 02:05:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:05:36,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-12-02 02:05:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:05:36,694 INFO L225 Difference]: With dead ends: 157 [2018-12-02 02:05:36,694 INFO L226 Difference]: Without dead ends: 144 [2018-12-02 02:05:36,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:05:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-02 02:05:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-02 02:05:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 02:05:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2018-12-02 02:05:36,706 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 37 [2018-12-02 02:05:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:05:36,706 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2018-12-02 02:05:36,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:05:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2018-12-02 02:05:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 02:05:36,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:05:36,707 INFO L402 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, 1, 1, 1] [2018-12-02 02:05:36,707 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:05:36,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:05:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1092260135, now seen corresponding path program 1 times [2018-12-02 02:05:36,708 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:05:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:05:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:05:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:05:37,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:05:37,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 02:05:37,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-12-02 02:05:37,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-02 02:05:37,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:05:37,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:05:37,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:05:37,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:05:37,776 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:51 [2018-12-02 02:05:40,517 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_33| (_ BitVec 64)) (|v_q#valueAsBitvector_32| (_ BitVec 64))) (and (= c___ieee754_pow_~z~1 (fp.div roundNearestTiesToEven c_~one_pow~0 (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_32|)) ((_ extract 31 0) |v_q#valueAsBitvector_33|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_32|) ((_ extract 62 52) |v_q#valueAsBitvector_32|) ((_ extract 51 0) |v_q#valueAsBitvector_32|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_33|) ((_ extract 62 52) |v_q#valueAsBitvector_33|) ((_ extract 51 0) |v_q#valueAsBitvector_33|)) |c___ieee754_pow_#in~x|))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:05:42,844 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_33| (_ BitVec 64)) (|v_q#valueAsBitvector_32| (_ BitVec 64))) (and (= |c___ieee754_pow_#res| (fp.div roundNearestTiesToEven c_~one_pow~0 (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_32|)) ((_ extract 31 0) |v_q#valueAsBitvector_33|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_32|) ((_ extract 62 52) |v_q#valueAsBitvector_32|) ((_ extract 51 0) |v_q#valueAsBitvector_32|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_33|) ((_ extract 62 52) |v_q#valueAsBitvector_33|) ((_ extract 51 0) |v_q#valueAsBitvector_33|)) |c___ieee754_pow_#in~x|))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:05:45,197 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_33| (_ BitVec 64)) (|v_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 (_ +zero 11 53)))) (and (= (fp.div roundNearestTiesToEven .cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_32|)) ((_ extract 31 0) |v_q#valueAsBitvector_33|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) |c_main_#t~ret86|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_32|) ((_ extract 62 52) |v_q#valueAsBitvector_32|) ((_ extract 51 0) |v_q#valueAsBitvector_32|)) .cse2) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_33|) ((_ extract 62 52) |v_q#valueAsBitvector_33|) ((_ extract 51 0) |v_q#valueAsBitvector_33|)) .cse2))))) is different from false [2018-12-02 02:05:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:05:48,644 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:05:48,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:05:48,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 02:05:48,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 02:05:48,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 02:05:48,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2018-12-02 02:05:48,662 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand 16 states. [2018-12-02 02:05:57,183 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_33| (_ BitVec 64)) (|v_q#valueAsBitvector_32| (_ BitVec 64))) (and (= c___ieee754_pow_~z~1 (fp.div roundNearestTiesToEven c_~one_pow~0 (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_32|)) ((_ extract 31 0) |v_q#valueAsBitvector_33|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_32|) ((_ extract 62 52) |v_q#valueAsBitvector_32|) ((_ extract 51 0) |v_q#valueAsBitvector_32|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_33|) ((_ extract 62 52) |v_q#valueAsBitvector_33|) ((_ extract 51 0) |v_q#valueAsBitvector_33|)) |c___ieee754_pow_#in~x|))) (= c___ieee754_pow_~x |c___ieee754_pow_#in~x|) (exists ((|v_q#valueAsBitvector_33| (_ BitVec 64)) (|v_q#valueAsBitvector_32| (_ BitVec 64))) (and (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_32|)) ((_ extract 31 0) |v_q#valueAsBitvector_33|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) c___ieee754_pow_~ax~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_32|) ((_ extract 62 52) |v_q#valueAsBitvector_32|) ((_ extract 51 0) |v_q#valueAsBitvector_32|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_33|) ((_ extract 62 52) |v_q#valueAsBitvector_33|) ((_ extract 51 0) |v_q#valueAsBitvector_33|)) |c___ieee754_pow_#in~x|))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:06:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:16,105 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-12-02 02:06:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 02:06:16,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-12-02 02:06:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:06:16,107 INFO L225 Difference]: With dead ends: 163 [2018-12-02 02:06:16,107 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 02:06:16,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=68, Invalid=250, Unknown=4, NotChecked=140, Total=462 [2018-12-02 02:06:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 02:06:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2018-12-02 02:06:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 02:06:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-12-02 02:06:16,115 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 39 [2018-12-02 02:06:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:06:16,115 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-12-02 02:06:16,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 02:06:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-12-02 02:06:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 02:06:16,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:06:16,116 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-02 02:06:16,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:06:16,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -928924063, now seen corresponding path program 1 times [2018-12-02 02:06:16,116 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:06:16,116 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/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-12-02 02:06:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:16,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:06:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:17,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:06:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:17,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:06:17,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:06:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:06:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:06:17,019 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 6 states. [2018-12-02 02:06:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:19,501 INFO L93 Difference]: Finished difference Result 225 states and 277 transitions. [2018-12-02 02:06:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:06:19,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-02 02:06:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:06:19,503 INFO L225 Difference]: With dead ends: 225 [2018-12-02 02:06:19,503 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 02:06:19,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:06:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 02:06:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-02 02:06:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-02 02:06:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2018-12-02 02:06:19,510 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 41 [2018-12-02 02:06:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:06:19,510 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2018-12-02 02:06:19,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:06:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2018-12-02 02:06:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:06:19,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:06:19,510 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:06:19,511 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:06:19,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash -726350400, now seen corresponding path program 1 times [2018-12-02 02:06:19,511 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 02:06:19,511 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_189108d0-1a0e-4bc4-912f-8f4b73e7aa13/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-12-02 02:06:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:20,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:06:20,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 02:06:20,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-12-02 02:06:20,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-02 02:06:20,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:06:20,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:06:20,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:06:20,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:06:20,555 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:96, output treesize:57 [2018-12-02 02:07:03,197 WARN L180 SmtUtils]: Spent 6.71 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 02:07:05,525 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_q#valueAsBitvector_35| (_ BitVec 64)) (|v_q#valueAsBitvector_34| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_35|) ((_ extract 62 52) |v_q#valueAsBitvector_35|) ((_ extract 51 0) |v_q#valueAsBitvector_35|)))) (and (= .cse0 (fp ((_ extract 63 63) |v_q#valueAsBitvector_34|) ((_ extract 62 52) |v_q#valueAsBitvector_34|) ((_ extract 51 0) |v_q#valueAsBitvector_34|))) (= |c___ieee754_pow_#res| (fp.div roundNearestTiesToEven c_~one_pow~0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_34|)) ((_ extract 31 0) |v_q#valueAsBitvector_35|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (= .cse0 |c___ieee754_pow_#in~x|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_~one_pow~0)) is different from false [2018-12-02 02:07:28,217 WARN L180 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 02:07:57,370 WARN L180 SmtUtils]: Spent 3.30 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 02:08:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:40,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 02:08:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 02:08:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 02:08:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 02:08:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=310, Unknown=24, NotChecked=36, Total=420 [2018-12-02 02:08:40,498 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 21 states. [2018-12-02 02:09:10,351 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 02:09:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:09:10,352 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-12-02 02:09:10,355 INFO L168 Benchmark]: Toolchain (without parser) took 451397.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 944.7 MB in the beginning and 995.9 MB in the end (delta: -51.2 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:09:10,355 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:09:10,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:09:10,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.66 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-12-02 02:09:10,356 INFO L168 Benchmark]: Boogie Preprocessor took 51.93 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:09:10,357 INFO L168 Benchmark]: RCFGBuilder took 41555.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:09:10,357 INFO L168 Benchmark]: TraceAbstraction took 409435.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 995.8 MB in the beginning and 995.9 MB in the end (delta: -140.8 kB). Peak memory consumption was 94.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:09:10,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.66 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. * Boogie Preprocessor took 51.93 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 41555.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 409435.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 995.8 MB in the beginning and 995.9 MB in the end (delta: -140.8 kB). Peak memory consumption was 94.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...