/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b10fda6cffff5fb350fcb38f45cdbf194fee7bf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false .......................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b10fda6cffff5fb350fcb38f45cdbf194fee7bf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 17:58:49,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:58:49,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:58:49,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:58:49,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:58:49,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:58:49,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:58:49,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:58:49,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:58:49,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:58:49,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:58:49,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:58:49,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:58:49,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:58:49,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:58:49,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:58:49,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:58:49,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:58:49,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:58:49,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:58:49,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:58:49,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:58:49,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:58:49,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:58:49,881 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:58:49,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:58:49,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:58:49,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:58:49,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:58:49,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:58:49,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:58:49,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:58:49,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:58:49,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:58:49,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:58:49,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:58:49,897 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 17:58:49,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:58:49,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:58:49,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:58:49,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:58:49,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:58:49,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:58:49,929 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:58:49,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:58:49,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:58:49,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:58:49,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:58:49,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:58:49,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:58:49,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:58:49,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:58:49,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:58:49,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:58:49,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:58:49,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:58:49,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:58:49,937 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 17:58:49,937 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:58:49,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 17:58:49,937 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b10fda6cffff5fb350fcb38f45cdbf194fee7bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 17:58:50,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:58:50,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:58:50,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:58:50,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:58:50,033 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:58:50,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c [2018-09-21 17:58:50,385 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0007d90b8/2473db7ba975458eb09e14e4f536dce7/FLAGf2a78d2da [2018-09-21 17:58:50,584 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:58:50,585 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c [2018-09-21 17:58:50,597 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0007d90b8/2473db7ba975458eb09e14e4f536dce7/FLAGf2a78d2da [2018-09-21 17:58:50,613 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0007d90b8/2473db7ba975458eb09e14e4f536dce7 [2018-09-21 17:58:50,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:58:50,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:58:50,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:58:50,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:58:50,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:58:50,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:58:50" (1/1) ... [2018-09-21 17:58:50,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510175c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:50, skipping insertion in model container [2018-09-21 17:58:50,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:58:50" (1/1) ... [2018-09-21 17:58:50,647 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:58:51,005 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:882) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$37(StandardFunctionHandler.java:260) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:160) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1549) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:513) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1928) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1748) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1725) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:339) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3980) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2445) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:183) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.preRun(MainDispatcher.java:348) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.Dispatcher.run(Dispatcher.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.doTranslation(CACSL2BoogieTranslatorObserver.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:152) 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-09-21 17:58:51,010 INFO L168 Benchmark]: Toolchain (without parser) took 391.82 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 17:58:51,013 INFO L168 Benchmark]: CDTParser took 0.23 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-09-21 17:58:51,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 17:58:51,017 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * 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:882) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 17:58:53,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:58:53,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:58:53,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:58:53,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:58:53,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:58:53,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:58:53,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:58:53,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:58:53,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:58:53,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:58:53,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:58:53,279 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:58:53,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:58:53,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:58:53,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:58:53,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:58:53,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:58:53,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:58:53,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:58:53,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:58:53,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:58:53,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:58:53,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:58:53,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:58:53,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:58:53,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:58:53,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:58:53,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:58:53,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:58:53,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:58:53,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:58:53,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:58:53,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:58:53,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:58:53,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:58:53,307 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 17:58:53,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:58:53,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:58:53,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:58:53,334 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:58:53,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:58:53,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:58:53,335 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:58:53,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:58:53,335 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:58:53,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 17:58:53,337 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 17:58:53,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:58:53,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:58:53,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:58:53,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:58:53,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:58:53,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:58:53,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:58:53,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:58:53,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:58:53,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:58:53,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:58:53,341 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 17:58:53,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:58:53,342 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 17:58:53,342 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 17:58:53,342 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b10fda6cffff5fb350fcb38f45cdbf194fee7bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 17:58:53,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:58:53,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:58:53,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:58:53,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:58:53,423 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:58:53,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c [2018-09-21 17:58:53,770 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e2b0694/04eb3dcdc09547278fda9ae27ec85e5a/FLAG4b574e89d [2018-09-21 17:58:54,044 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:58:54,045 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0875_true-unreach-call.c [2018-09-21 17:58:54,057 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e2b0694/04eb3dcdc09547278fda9ae27ec85e5a/FLAG4b574e89d [2018-09-21 17:58:54,072 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e2b0694/04eb3dcdc09547278fda9ae27ec85e5a [2018-09-21 17:58:54,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:58:54,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:58:54,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:58:54,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:58:54,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:58:54,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:54,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e3462a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54, skipping insertion in model container [2018-09-21 17:58:54,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:54,105 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:58:54,640 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:58:54,664 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 17:58:54,864 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:58:54,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54 WrapperNode [2018-09-21 17:58:54,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 17:58:54,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 17:58:54,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 17:58:54,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 17:58:54,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:54,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:54,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:54,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:55,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:55,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:55,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... [2018-09-21 17:58:55,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 17:58:55,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 17:58:55,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 17:58:55,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 17:58:55,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 17:58:55,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 17:58:55,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 17:58:55,256 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-21 17:58:55,256 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-21 17:58:55,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-21 17:58:55,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-21 17:58:55,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-21 17:58:55,260 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-21 17:58:55,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-21 17:58:55,260 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-21 17:58:55,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 17:58:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 17:58:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 17:58:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-21 17:58:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 17:58:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-21 17:58:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 17:58:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 17:58:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 17:58:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-21 17:58:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-21 17:58:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-21 17:58:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-21 17:58:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-21 17:58:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-21 17:58:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-21 17:58:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-21 17:58:55,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 17:58:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 17:58:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 17:58:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-21 17:58:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 17:58:55,902 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:56,444 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:56,483 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:57,002 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:57,027 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:58,183 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,537 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,724 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,766 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,882 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,925 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:58:59,960 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,093 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,121 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,150 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,873 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,898 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:00,978 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:03,436 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:03,518 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:06,324 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:08,568 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:10,837 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:11,949 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:14,155 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:14,164 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:14,175 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:14,244 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:14,301 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:16,309 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:23,813 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:23,826 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:23,844 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:23,855 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:24,189 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:27,249 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:27,260 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:27,596 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:43,276 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:43,693 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:43,704 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:43,942 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:43,998 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:44,075 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:49,078 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:49,099 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:49,120 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:51,206 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 17:59:51,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 05:59:51 BoogieIcfgContainer [2018-09-21 17:59:51,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 17:59:51,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 17:59:51,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 17:59:51,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 17:59:51,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 05:58:54" (1/3) ... [2018-09-21 17:59:51,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b607538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 05:59:51, skipping insertion in model container [2018-09-21 17:59:51,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:58:54" (2/3) ... [2018-09-21 17:59:51,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b607538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 05:59:51, skipping insertion in model container [2018-09-21 17:59:51,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 05:59:51" (3/3) ... [2018-09-21 17:59:51,218 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0875_true-unreach-call.c [2018-09-21 17:59:51,228 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 17:59:51,238 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 17:59:51,284 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 17:59:51,285 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 17:59:51,285 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 17:59:51,285 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 17:59:51,285 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 17:59:51,286 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 17:59:51,287 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 17:59:51,287 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 17:59:51,287 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 17:59:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states. [2018-09-21 17:59:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-21 17:59:51,338 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:59:51,339 INFO L376 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] [2018-09-21 17:59:51,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:59:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -111446269, now seen corresponding path program 1 times [2018-09-21 17:59:51,351 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:59:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 17:59:51,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:59:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:59:51,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:59:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 17:59:51,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:59:51,646 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:59:51,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 17:59:51,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 17:59:51,664 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 17:59:51,664 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 17:59:51,667 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 2 states. [2018-09-21 17:59:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:59:51,730 INFO L93 Difference]: Finished difference Result 521 states and 605 transitions. [2018-09-21 17:59:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 17:59:51,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-09-21 17:59:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:59:51,754 INFO L225 Difference]: With dead ends: 521 [2018-09-21 17:59:51,754 INFO L226 Difference]: Without dead ends: 516 [2018-09-21 17:59:51,756 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-09-21 17:59:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-09-21 17:59:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2018-09-21 17:59:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-09-21 17:59:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 599 transitions. [2018-09-21 17:59:51,849 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 599 transitions. Word has length 28 [2018-09-21 17:59:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:59:51,850 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 599 transitions. [2018-09-21 17:59:51,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 17:59:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 599 transitions. [2018-09-21 17:59:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-21 17:59:51,859 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:59:51,859 INFO L376 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, 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-09-21 17:59:51,860 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:59:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2064504582, now seen corresponding path program 1 times [2018-09-21 17:59:51,861 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:59:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 17:59:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:59:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:59:52,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:59:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 17:59:52,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:59:52,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:59:52,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-21 17:59:52,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-21 17:59:52,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-21 17:59:52,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 17:59:52,287 INFO L87 Difference]: Start difference. First operand 516 states and 599 transitions. Second operand 3 states. [2018-09-21 17:59:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:59:52,331 INFO L93 Difference]: Finished difference Result 517 states and 599 transitions. [2018-09-21 17:59:52,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-21 17:59:52,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-09-21 17:59:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:59:52,341 INFO L225 Difference]: With dead ends: 517 [2018-09-21 17:59:52,341 INFO L226 Difference]: Without dead ends: 516 [2018-09-21 17:59:52,342 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 17:59:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-09-21 17:59:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2018-09-21 17:59:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-09-21 17:59:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 598 transitions. [2018-09-21 17:59:52,373 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 598 transitions. Word has length 74 [2018-09-21 17:59:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:59:52,376 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 598 transitions. [2018-09-21 17:59:52,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-21 17:59:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 598 transitions. [2018-09-21 17:59:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-21 17:59:52,381 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:59:52,381 INFO L376 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, 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-09-21 17:59:52,382 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:59:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -813369981, now seen corresponding path program 1 times [2018-09-21 17:59:52,383 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:59:52,383 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 17:59:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:59:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:59:52,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:59:52,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 17:59:52,882 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 17:59:52,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 17:59:52,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 17:59:52,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 17:59:52,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 17:59:53,016 INFO L477 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 20 treesize of output 16 [2018-09-21 17:59:53,030 INFO L477 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 16 treesize of output 4 [2018-09-21 17:59:53,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 17:59:53,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 17:59:53,075 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-09-21 17:59:53,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 17:59:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 17:59:53,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:59:53,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:59:53,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 17:59:53,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 17:59:53,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 17:59:53,592 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 17:59:53,592 INFO L87 Difference]: Start difference. First operand 516 states and 598 transitions. Second operand 9 states. [2018-09-21 17:59:54,548 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:00:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:00:18,248 INFO L93 Difference]: Finished difference Result 520 states and 601 transitions. [2018-09-21 18:00:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:00:18,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-09-21 18:00:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:00:18,258 INFO L225 Difference]: With dead ends: 520 [2018-09-21 18:00:18,258 INFO L226 Difference]: Without dead ends: 518 [2018-09-21 18:00:18,259 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:00:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-09-21 18:00:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2018-09-21 18:00:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-09-21 18:00:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 597 transitions. [2018-09-21 18:00:18,285 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 597 transitions. Word has length 79 [2018-09-21 18:00:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:00:18,285 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 597 transitions. [2018-09-21 18:00:18,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:00:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 597 transitions. [2018-09-21 18:00:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-21 18:00:18,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:00:18,287 INFO L376 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, 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-09-21 18:00:18,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:00:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 364882791, now seen corresponding path program 1 times [2018-09-21 18:00:18,288 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:00:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:00:18,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:00:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:00:18,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:00:18,857 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:00:18,876 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:00:18,878 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:00:18,916 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:00:18,958 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:00:18,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:00:18,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:00:19,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:00:19,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:00:19,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:00:19,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:00:19,316 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:00:19,334 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:00:19,357 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:00:19,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:00:19,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:00:19,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:00:19,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:00:19,527 INFO L477 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 35 treesize of output 27 [2018-09-21 18:00:19,535 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:00:19,546 INFO L477 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 27 treesize of output 15 [2018-09-21 18:00:19,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:00:19,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:00:19,692 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-09-21 18:00:19,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:00:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:00:20,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:00:20,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:00:20,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-21 18:00:20,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-21 18:00:20,220 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-21 18:00:20,220 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:00:20,220 INFO L87 Difference]: Start difference. First operand 516 states and 597 transitions. Second operand 12 states. [2018-09-21 18:00:21,500 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:00:22,061 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:00:22,401 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:00:23,509 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:00:26,216 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:01:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:01:00,565 INFO L93 Difference]: Finished difference Result 527 states and 610 transitions. [2018-09-21 18:01:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:01:00,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-09-21 18:01:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:01:00,570 INFO L225 Difference]: With dead ends: 527 [2018-09-21 18:01:00,570 INFO L226 Difference]: Without dead ends: 525 [2018-09-21 18:01:00,571 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:01:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-09-21 18:01:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2018-09-21 18:01:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-09-21 18:01:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 596 transitions. [2018-09-21 18:01:00,585 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 596 transitions. Word has length 81 [2018-09-21 18:01:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:01:00,586 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 596 transitions. [2018-09-21 18:01:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-21 18:01:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 596 transitions. [2018-09-21 18:01:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-21 18:01:00,587 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:01:00,588 INFO L376 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, 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-09-21 18:01:00,588 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:01:00,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1252386472, now seen corresponding path program 1 times [2018-09-21 18:01:00,589 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:01:00,589 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:01:00,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:01:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:01:01,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:01:01,379 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:01,388 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:01,390 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:01:01,417 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:01,439 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:01:01,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:01,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:01,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:01:01,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-09-21 18:01:01,956 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:01,960 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:01,964 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:01:01,982 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:02,014 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:01:02,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:01:02,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-09-21 18:01:02,336 INFO L477 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 35 treesize of output 27 [2018-09-21 18:01:02,357 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:02,365 INFO L477 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 27 treesize of output 15 [2018-09-21 18:01:02,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,456 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-09-21 18:01:02,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-09-21 18:01:02,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:02,775 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:02,777 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:01:02,798 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:02,819 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:01:02,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:02,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:01:02,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-09-21 18:01:03,506 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:03,523 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:03,525 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:01:03,552 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:03,576 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:01:03,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:03,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:03,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-21 18:01:03,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-09-21 18:01:03,944 INFO L477 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 35 treesize of output 27 [2018-09-21 18:01:03,956 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:03,964 INFO L477 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 27 treesize of output 15 [2018-09-21 18:01:03,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:03,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:04,044 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-09-21 18:01:04,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:35 [2018-09-21 18:01:05,232 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 36 [2018-09-21 18:01:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:01:05,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:01:05,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:01:05,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:01:05,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:01:05,317 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:01:05,318 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:01:05,318 INFO L87 Difference]: Start difference. First operand 516 states and 596 transitions. Second operand 20 states. [2018-09-21 18:01:06,328 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-21 18:01:07,770 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:01:08,245 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:01:08,708 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:01:09,466 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-21 18:01:09,808 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-21 18:01:10,719 WARN L178 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:01:11,513 WARN L178 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-21 18:01:12,165 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:01:12,598 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-21 18:01:13,055 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:01:13,497 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:01:14,127 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:01:16,822 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-09-21 18:02:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:02:47,840 INFO L93 Difference]: Finished difference Result 619 states and 709 transitions. [2018-09-21 18:02:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-21 18:02:47,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-09-21 18:02:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:02:47,850 INFO L225 Difference]: With dead ends: 619 [2018-09-21 18:02:47,851 INFO L226 Difference]: Without dead ends: 616 [2018-09-21 18:02:47,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:02:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-09-21 18:02:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 515. [2018-09-21 18:02:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-09-21 18:02:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 594 transitions. [2018-09-21 18:02:47,873 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 594 transitions. Word has length 81 [2018-09-21 18:02:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:02:47,873 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 594 transitions. [2018-09-21 18:02:47,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:02:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 594 transitions. [2018-09-21 18:02:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-21 18:02:47,875 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:02:47,875 INFO L376 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, 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-09-21 18:02:47,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:02:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -687944521, now seen corresponding path program 1 times [2018-09-21 18:02:47,881 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:02:47,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:02:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:02:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:02:48,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:02:48,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:02:48,393 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:02:48,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:48,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:02:48,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:02:48,638 INFO L477 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 20 treesize of output 16 [2018-09-21 18:02:48,656 INFO L477 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 16 treesize of output 4 [2018-09-21 18:02:48,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,268 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-09-21 18:02:49,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:02:49,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:49,381 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:49,383 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:02:49,397 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:49,419 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:02:49,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:02:49,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-09-21 18:02:49,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 28 [2018-09-21 18:02:49,646 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:49,729 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-09-21 18:02:49,730 INFO L477 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 28 treesize of output 27 [2018-09-21 18:02:49,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:49,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:02:49,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:39 [2018-09-21 18:02:50,025 INFO L477 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 50 [2018-09-21 18:02:50,036 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:50,045 INFO L477 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 50 treesize of output 34 [2018-09-21 18:02:50,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:50,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:50,094 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-09-21 18:02:50,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:46 [2018-09-21 18:02:51,521 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:51,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:51,523 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:02:51,533 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:51,554 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:02:51,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:51,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:51,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:02:51,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:02:52,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:52,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:02:52,251 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:02:52,261 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:52,282 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:02:52,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:52,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:52,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:02:52,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:02:52,600 INFO L477 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 35 treesize of output 27 [2018-09-21 18:02:52,607 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:02:52,612 INFO L477 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 27 treesize of output 15 [2018-09-21 18:02:52,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:02:52,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:02:52,643 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-09-21 18:02:52,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:02:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:02:54,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:02:54,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:02:54,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:02:54,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:02:54,063 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:02:54,063 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:02:54,064 INFO L87 Difference]: Start difference. First operand 515 states and 594 transitions. Second operand 23 states. [2018-09-21 18:02:57,419 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:02:58,193 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:02:58,810 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:03:01,034 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-09-21 18:03:02,095 WARN L178 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-09-21 18:03:05,027 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:03:05,606 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:03:07,801 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-21 18:03:08,868 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-09-21 18:03:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:03:54,582 INFO L93 Difference]: Finished difference Result 663 states and 782 transitions. [2018-09-21 18:03:54,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-21 18:03:54,584 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2018-09-21 18:03:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:03:54,588 INFO L225 Difference]: With dead ends: 663 [2018-09-21 18:03:54,588 INFO L226 Difference]: Without dead ends: 661 [2018-09-21 18:03:54,590 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2018-09-21 18:03:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-21 18:03:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 518. [2018-09-21 18:03:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-21 18:03:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 599 transitions. [2018-09-21 18:03:54,607 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 599 transitions. Word has length 84 [2018-09-21 18:03:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:03:54,607 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 599 transitions. [2018-09-21 18:03:54,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:03:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 599 transitions. [2018-09-21 18:03:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-21 18:03:54,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:03:54,611 INFO L376 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, 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-09-21 18:03:54,611 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:03:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash 87642351, now seen corresponding path program 1 times [2018-09-21 18:03:54,613 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:03:54,613 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:03:54,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:03:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:03:54,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:03:55,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:03:55,015 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:03:55,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:55,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:03:55,378 INFO L477 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 20 treesize of output 16 [2018-09-21 18:03:55,387 INFO L477 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 16 treesize of output 4 [2018-09-21 18:03:55,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,647 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-09-21 18:03:55,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:03:55,824 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:55,825 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:55,827 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:03:55,848 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:55,873 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:03:55,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:55,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:55,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-09-21 18:03:56,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 28 [2018-09-21 18:03:56,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:56,067 INFO L477 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 28 treesize of output 27 [2018-09-21 18:03:56,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:56,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:56,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:56,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:39 [2018-09-21 18:03:56,264 INFO L477 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 50 [2018-09-21 18:03:56,275 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:56,283 INFO L477 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 50 treesize of output 34 [2018-09-21 18:03:56,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:56,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:56,332 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-09-21 18:03:56,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:46 [2018-09-21 18:03:57,549 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:03:57,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:57,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:57,861 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-21 18:03:57,870 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:57,888 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:03:57,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:57,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:57,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:57,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:03:58,640 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:58,652 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:58,654 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-21 18:03:58,664 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:58,685 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:03:58,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:58,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:58,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:58,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:03:58,999 INFO L477 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 35 treesize of output 27 [2018-09-21 18:03:59,006 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:59,011 INFO L477 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 27 treesize of output 15 [2018-09-21 18:03:59,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:59,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:59,039 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-09-21 18:03:59,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:04:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:04:00,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:00,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:00,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:04:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:04:00,033 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:04:00,033 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:04:00,034 INFO L87 Difference]: Start difference. First operand 518 states and 599 transitions. Second operand 22 states. [2018-09-21 18:04:02,379 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:04:03,183 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-21 18:04:03,691 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:04:04,614 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:04:05,569 WARN L178 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:04:07,385 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-09-21 18:04:08,164 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-09-21 18:04:11,563 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:04:14,295 WARN L178 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:04:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:04:42,592 INFO L93 Difference]: Finished difference Result 620 states and 711 transitions. [2018-09-21 18:04:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-21 18:04:42,596 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-09-21 18:04:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:04:42,600 INFO L225 Difference]: With dead ends: 620 [2018-09-21 18:04:42,601 INFO L226 Difference]: Without dead ends: 618 [2018-09-21 18:04:42,602 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=182, Invalid=1710, Unknown=0, NotChecked=0, Total=1892 [2018-09-21 18:04:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-09-21 18:04:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 515. [2018-09-21 18:04:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-09-21 18:04:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 593 transitions. [2018-09-21 18:04:42,616 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 593 transitions. Word has length 85 [2018-09-21 18:04:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:04:42,617 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 593 transitions. [2018-09-21 18:04:42,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:04:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 593 transitions. [2018-09-21 18:04:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-21 18:04:42,620 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:04:42,620 INFO L376 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, 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-09-21 18:04:42,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:04:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1060349672, now seen corresponding path program 1 times [2018-09-21 18:04:42,621 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:04:42,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:04:42,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:04:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:04:43,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:04:43,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:04:43,681 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:04:43,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:04:43,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:04:43,757 INFO L477 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 20 treesize of output 16 [2018-09-21 18:04:43,762 INFO L477 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 16 treesize of output 4 [2018-09-21 18:04:43,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,778 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-09-21 18:04:43,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:04:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:04:44,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:44,026 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:44,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:04:44,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:04:44,027 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:04:44,027 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:04:44,027 INFO L87 Difference]: Start difference. First operand 515 states and 593 transitions. Second operand 9 states. [2018-09-21 18:04:46,116 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:05:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:05:15,883 INFO L93 Difference]: Finished difference Result 584 states and 688 transitions. [2018-09-21 18:05:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:05:15,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-09-21 18:05:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:05:15,887 INFO L225 Difference]: With dead ends: 584 [2018-09-21 18:05:15,887 INFO L226 Difference]: Without dead ends: 496 [2018-09-21 18:05:15,887 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:05:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-09-21 18:05:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-09-21 18:05:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-09-21 18:05:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 519 transitions. [2018-09-21 18:05:15,899 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 519 transitions. Word has length 85 [2018-09-21 18:05:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:05:15,899 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 519 transitions. [2018-09-21 18:05:15,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:05:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 519 transitions. [2018-09-21 18:05:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-21 18:05:15,902 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:05:15,903 INFO L376 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, 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-09-21 18:05:15,903 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:05:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1135699363, now seen corresponding path program 1 times [2018-09-21 18:05:15,904 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:05:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:05:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:05:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:05:16,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:05:16,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:05:16,206 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:05:16,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:16,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:05:16,267 INFO L477 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 20 treesize of output 16 [2018-09-21 18:05:16,273 INFO L477 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 16 treesize of output 4 [2018-09-21 18:05:16,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,288 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-09-21 18:05:16,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:05:16,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-09-21 18:05:16,375 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-09-21 18:05:16,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:16,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:16,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-21 18:05:16,466 INFO L477 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 58 treesize of output 44 [2018-09-21 18:05:16,473 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:16,478 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-09-21 18:05:16,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:16,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:16,511 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-09-21 18:05:16,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-09-21 18:05:17,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:05:17,633 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:05:17,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:17,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:17,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:17,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:05:17,853 INFO L477 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 20 treesize of output 16 [2018-09-21 18:05:17,870 INFO L477 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 16 treesize of output 4 [2018-09-21 18:05:17,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:17,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:17,938 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-09-21 18:05:17,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:05:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:05:18,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:05:18,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:05:18,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:05:18,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:05:18,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:05:18,945 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:05:18,945 INFO L87 Difference]: Start difference. First operand 458 states and 519 transitions. Second operand 20 states. [2018-09-21 18:05:20,190 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:05:24,069 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:05:26,086 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:05:26,704 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-21 18:05:28,028 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:05:31,199 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:05:31,962 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-21 18:06:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:14,103 INFO L93 Difference]: Finished difference Result 800 states and 913 transitions. [2018-09-21 18:06:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-21 18:06:14,107 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-09-21 18:06:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:14,109 INFO L225 Difference]: With dead ends: 800 [2018-09-21 18:06:14,109 INFO L226 Difference]: Without dead ends: 604 [2018-09-21 18:06:14,110 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2018-09-21 18:06:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-09-21 18:06:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 487. [2018-09-21 18:06:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-21 18:06:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 563 transitions. [2018-09-21 18:06:14,131 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 563 transitions. Word has length 87 [2018-09-21 18:06:14,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:14,131 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 563 transitions. [2018-09-21 18:06:14,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:06:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 563 transitions. [2018-09-21 18:06:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-21 18:06:14,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:14,133 INFO L376 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, 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-09-21 18:06:14,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 871358805, now seen corresponding path program 1 times [2018-09-21 18:06:14,136 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:06:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:14,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:14,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:06:14,521 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:06:14,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:14,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:14,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:06:14,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:14,587 INFO L477 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 20 treesize of output 16 [2018-09-21 18:06:14,594 INFO L477 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 16 treesize of output 4 [2018-09-21 18:06:14,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:14,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:14,609 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-09-21 18:06:14,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:14,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:14,782 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:14,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:06:14,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:06:14,783 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:06:14,783 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:06:14,784 INFO L87 Difference]: Start difference. First operand 487 states and 563 transitions. Second operand 8 states. [2018-09-21 18:06:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:37,083 INFO L93 Difference]: Finished difference Result 648 states and 743 transitions. [2018-09-21 18:06:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:06:37,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-09-21 18:06:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:37,087 INFO L225 Difference]: With dead ends: 648 [2018-09-21 18:06:37,087 INFO L226 Difference]: Without dead ends: 636 [2018-09-21 18:06:37,088 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:06:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-09-21 18:06:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 493. [2018-09-21 18:06:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-09-21 18:06:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 568 transitions. [2018-09-21 18:06:37,101 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 568 transitions. Word has length 87 [2018-09-21 18:06:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:37,101 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 568 transitions. [2018-09-21 18:06:37,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:06:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 568 transitions. [2018-09-21 18:06:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-21 18:06:37,105 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:37,105 INFO L376 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, 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-09-21 18:06:37,105 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash 62012179, now seen corresponding path program 1 times [2018-09-21 18:06:37,106 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:37,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:06:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:37,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:37,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:37,628 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:37,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:06:37,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:06:37,629 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:06:37,629 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:06:37,630 INFO L87 Difference]: Start difference. First operand 493 states and 568 transitions. Second operand 7 states. [2018-09-21 18:07:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:01,238 INFO L93 Difference]: Finished difference Result 499 states and 574 transitions. [2018-09-21 18:07:01,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:07:01,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-09-21 18:07:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:01,242 INFO L225 Difference]: With dead ends: 499 [2018-09-21 18:07:01,242 INFO L226 Difference]: Without dead ends: 499 [2018-09-21 18:07:01,242 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:07:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-09-21 18:07:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2018-09-21 18:07:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-09-21 18:07:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 572 transitions. [2018-09-21 18:07:01,255 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 572 transitions. Word has length 87 [2018-09-21 18:07:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:01,255 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 572 transitions. [2018-09-21 18:07:01,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:07:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 572 transitions. [2018-09-21 18:07:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-21 18:07:01,258 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:01,259 INFO L376 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, 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-09-21 18:07:01,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1743719205, now seen corresponding path program 1 times [2018-09-21 18:07:01,260 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:07:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:01,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:01,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:07:01,564 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:01,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:01,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:01,626 INFO L477 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 20 treesize of output 16 [2018-09-21 18:07:01,632 INFO L477 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 16 treesize of output 4 [2018-09-21 18:07:01,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,652 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-09-21 18:07:01,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:01,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-09-21 18:07:01,773 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-09-21 18:07:01,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:01,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:01,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-21 18:07:01,862 INFO L477 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 58 treesize of output 44 [2018-09-21 18:07:01,870 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:07:01,875 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-09-21 18:07:01,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:01,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:01,909 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-09-21 18:07:01,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-09-21 18:07:03,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:07:03,019 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:03,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:03,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:03,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:03,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:03,244 INFO L477 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 20 treesize of output 16 [2018-09-21 18:07:03,260 INFO L477 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 16 treesize of output 4 [2018-09-21 18:07:03,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:03,286 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-09-21 18:07:03,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:07:04,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:04,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:04,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:07:04,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:07:04,079 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:07:04,079 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:07:04,080 INFO L87 Difference]: Start difference. First operand 497 states and 572 transitions. Second operand 19 states. [2018-09-21 18:07:07,866 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-09-21 18:07:08,761 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:07:10,766 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:07:11,381 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-21 18:07:14,552 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:07:15,939 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:07:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:42,632 INFO L93 Difference]: Finished difference Result 777 states and 874 transitions. [2018-09-21 18:07:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-21 18:07:42,634 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-09-21 18:07:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:42,638 INFO L225 Difference]: With dead ends: 777 [2018-09-21 18:07:42,638 INFO L226 Difference]: Without dead ends: 582 [2018-09-21 18:07:42,639 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2018-09-21 18:07:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-21 18:07:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 445. [2018-09-21 18:07:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-21 18:07:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 495 transitions. [2018-09-21 18:07:42,651 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 495 transitions. Word has length 88 [2018-09-21 18:07:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 495 transitions. [2018-09-21 18:07:42,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:07:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 495 transitions. [2018-09-21 18:07:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-21 18:07:42,654 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:42,655 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:07:42,655 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1373233351, now seen corresponding path program 1 times [2018-09-21 18:07:42,657 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:07:42,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:42,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:43,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:07:43,134 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:07:43,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:43,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:43,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:43,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:43,231 INFO L477 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 20 treesize of output 16 [2018-09-21 18:07:43,236 INFO L477 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 16 treesize of output 4 [2018-09-21 18:07:43,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:43,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:43,252 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-09-21 18:07:43,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:07:43,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:43,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:43,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-21 18:07:43,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-21 18:07:43,607 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-21 18:07:43,607 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:07:43,608 INFO L87 Difference]: Start difference. First operand 445 states and 495 transitions. Second operand 14 states. [2018-09-21 18:07:52,629 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:07:53,425 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:08:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:06,578 INFO L93 Difference]: Finished difference Result 448 states and 498 transitions. [2018-09-21 18:08:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-21 18:08:06,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-09-21 18:08:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:06,582 INFO L225 Difference]: With dead ends: 448 [2018-09-21 18:08:06,582 INFO L226 Difference]: Without dead ends: 437 [2018-09-21 18:08:06,583 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-09-21 18:08:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-09-21 18:08:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2018-09-21 18:08:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-21 18:08:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 485 transitions. [2018-09-21 18:08:06,591 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 485 transitions. Word has length 103 [2018-09-21 18:08:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:06,592 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 485 transitions. [2018-09-21 18:08:06,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-21 18:08:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 485 transitions. [2018-09-21 18:08:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-21 18:08:06,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:06,596 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 18:08:06,596 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 135237640, now seen corresponding path program 1 times [2018-09-21 18:08:06,597 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:08:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:07,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:07,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:08:07,970 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:08:07,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:07,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:07,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:07,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:08,041 INFO L477 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 20 treesize of output 16 [2018-09-21 18:08:08,047 INFO L477 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 16 treesize of output 4 [2018-09-21 18:08:08,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:08,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:08,070 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-09-21 18:08:08,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-21 18:08:08,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:08,591 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:08,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:08:08,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:08:08,592 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:08:08,592 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:08:08,592 INFO L87 Difference]: Start difference. First operand 436 states and 485 transitions. Second operand 10 states. [2018-09-21 18:08:11,205 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:08:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:21,794 INFO L93 Difference]: Finished difference Result 439 states and 487 transitions. [2018-09-21 18:08:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:08:21,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-09-21 18:08:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:21,799 INFO L225 Difference]: With dead ends: 439 [2018-09-21 18:08:21,799 INFO L226 Difference]: Without dead ends: 433 [2018-09-21 18:08:21,799 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:08:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-09-21 18:08:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 420. [2018-09-21 18:08:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-09-21 18:08:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 459 transitions. [2018-09-21 18:08:21,809 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 459 transitions. Word has length 112 [2018-09-21 18:08:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:21,809 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 459 transitions. [2018-09-21 18:08:21,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:08:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 459 transitions. [2018-09-21 18:08:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-21 18:08:21,814 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:21,814 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2018-09-21 18:08:21,814 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1059625382, now seen corresponding path program 1 times [2018-09-21 18:08:21,815 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:08:21,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:22,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:23,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:08:23,046 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:08:23,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:23,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:23,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:23,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:23,121 INFO L477 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 20 treesize of output 16 [2018-09-21 18:08:23,126 INFO L477 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 16 treesize of output 4 [2018-09-21 18:08:23,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:23,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:23,142 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-09-21 18:08:23,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-21 18:08:23,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:23,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:23,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:08:23,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:08:23,551 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:08:23,552 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:08:23,552 INFO L87 Difference]: Start difference. First operand 420 states and 459 transitions. Second operand 10 states. [2018-09-21 18:08:25,782 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:08:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:35,092 INFO L93 Difference]: Finished difference Result 424 states and 463 transitions. [2018-09-21 18:08:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:08:35,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-09-21 18:08:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:35,096 INFO L225 Difference]: With dead ends: 424 [2018-09-21 18:08:35,096 INFO L226 Difference]: Without dead ends: 417 [2018-09-21 18:08:35,096 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:08:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-09-21 18:08:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2018-09-21 18:08:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-09-21 18:08:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 450 transitions. [2018-09-21 18:08:35,104 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 450 transitions. Word has length 115 [2018-09-21 18:08:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:35,105 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 450 transitions. [2018-09-21 18:08:35,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:08:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 450 transitions. [2018-09-21 18:08:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-21 18:08:35,106 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:35,109 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1] [2018-09-21 18:08:35,109 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash -858588624, now seen corresponding path program 1 times [2018-09-21 18:08:35,110 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:35,110 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-21 18:08:35,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:39,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:39,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-21 18:08:39,259 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-21 18:08:39,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:39,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:39,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:39,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:39,441 INFO L477 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 20 treesize of output 16 [2018-09-21 18:08:39,447 INFO L477 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 16 treesize of output 4 [2018-09-21 18:08:39,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:39,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:39,468 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-09-21 18:08:39,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-21 18:08:39,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:39,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:39,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:08:39,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:08:39,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:08:39,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:08:39,998 INFO L87 Difference]: Start difference. First operand 415 states and 450 transitions. Second operand 10 states. [2018-09-21 18:08:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:46,515 INFO L93 Difference]: Finished difference Result 396 states and 431 transitions. [2018-09-21 18:08:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:08:46,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-09-21 18:08:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:46,517 INFO L225 Difference]: With dead ends: 396 [2018-09-21 18:08:46,517 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:08:46,518 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:08:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:08:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:08:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:08:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:08:46,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-09-21 18:08:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:46,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:08:46,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:08:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:08:46,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:08:46,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:08:46 BoogieIcfgContainer [2018-09-21 18:08:46,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:08:46,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:08:46,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:08:46,526 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:08:46,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 05:59:51" (3/4) ... [2018-09-21 18:08:46,530 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:08:46,538 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-09-21 18:08:46,538 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2018-09-21 18:08:46,538 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-21 18:08:46,538 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:08:46,538 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure scalbn_double [2018-09-21 18:08:46,541 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure copysign_double [2018-09-21 18:08:46,541 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-09-21 18:08:46,542 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_pow [2018-09-21 18:08:46,542 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-21 18:08:46,542 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:08:46,576 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2018-09-21 18:08:46,580 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2018-09-21 18:08:46,584 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-21 18:08:46,586 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-21 18:08:46,886 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:08:46,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:08:46,892 INFO L168 Benchmark]: Toolchain (without parser) took 592814.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 951.9 MB in the beginning and 1.0 GB in the end (delta: -52.3 MB). Peak memory consumption was 169.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,893 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:08:46,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.7 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,894 INFO L168 Benchmark]: Boogie Preprocessor took 234.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,895 INFO L168 Benchmark]: RCFGBuilder took 56043.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,896 INFO L168 Benchmark]: TraceAbstraction took 535316.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 999.4 MB in the beginning and 1.0 GB in the end (delta: -37.3 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,896 INFO L168 Benchmark]: Witness Printer took 365.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:46,901 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 847.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.7 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 234.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 56043.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 535316.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 999.4 MB in the beginning and 1.0 GB in the end (delta: -37.3 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Witness Printer took 365.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 539 locations, 1 error locations. SAFE Result, 535.2s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 496.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9083 SDtfs, 10054 SDslu, 76853 SDs, 0 SdLazy, 10420 SolverSat, 269 SolverUnsat, 79 SolverUnknown, 0 SolverNotchecked, 420.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1598 GetRequests, 1250 SyntacticMatches, 5 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 61.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 811 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 9.6s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1421 ConstructedInterpolants, 491 QuantifiedInterpolants, 1307979 SizeOfPredicates, 184 NumberOfNonLiveVariables, 4412 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 78/78 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...