/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0877_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_0877_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 533380071f86516c77adeaa4e61a531bca0d059c --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_0877_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 533380071f86516c77adeaa4e61a531bca0d059c --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:59:48,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:59:48,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:59:48,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:59:48,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:59:48,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:59:48,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:59:48,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:59:48,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:59:48,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:59:48,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:59:48,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:59:48,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:59:48,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:59:48,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:59:48,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:59:48,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:59:48,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:59:48,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:59:48,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:59:48,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:59:48,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:59:48,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:59:48,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:59:48,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:59:48,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:59:48,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:59:48,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:59:48,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:59:48,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:59:48,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:59:48,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:59:48,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:59:48,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:59:48,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:59:48,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:59:48,917 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:59:48,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:59:48,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:59:48,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:59:48,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:59:48,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:59:48,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:59:48,950 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:59:48,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:59:48,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:59:48,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 17:59:48,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:59:48,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:59:48,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:59:48,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:59:48,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:59:48,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:59:48,955 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:59:48,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:59:48,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:59:48,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:59:48,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:59:48,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:59:48,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:59:48,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:59:48,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:59:48,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:59:48,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 17:59:48,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:59:48,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 17:59:48,958 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 -> 533380071f86516c77adeaa4e61a531bca0d059c 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:59:49,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:59:49,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:59:49,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:59:49,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:59:49,056 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:59:49,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0877_true-unreach-call.c [2018-09-21 17:59:49,416 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a11db3a/99e9f6e7252e41ccbeb98ed56338aab5/FLAG36001b27c [2018-09-21 17:59:49,649 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:59:49,652 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0877_true-unreach-call.c [2018-09-21 17:59:49,670 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a11db3a/99e9f6e7252e41ccbeb98ed56338aab5/FLAG36001b27c [2018-09-21 17:59:49,687 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a11db3a/99e9f6e7252e41ccbeb98ed56338aab5 [2018-09-21 17:59:49,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:59:49,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:59:49,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:59:49,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:59:49,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:59:49,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:59:49" (1/1) ... [2018-09-21 17:59:49,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c289bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:49, skipping insertion in model container [2018-09-21 17:59:49,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:59:49" (1/1) ... [2018-09-21 17:59:49,722 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:59:50,102 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:59:50,110 INFO L168 Benchmark]: Toolchain (without parser) took 417.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 931.7 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:59:50,112 INFO L168 Benchmark]: CDTParser took 0.18 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:59:50,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 931.7 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:59:50,117 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.18 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 412.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 931.7 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:59:52,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:59:52,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:59:52,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:59:52,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:59:52,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:59:52,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:59:52,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:59:52,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:59:52,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:59:52,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:59:52,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:59:52,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:59:52,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:59:52,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:59:52,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:59:52,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:59:52,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:59:52,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:59:52,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:59:52,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:59:52,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:59:52,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:59:52,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:59:52,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:59:52,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:59:52,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:59:52,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:59:52,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:59:52,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:59:52,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:59:52,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:59:52,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:59:52,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:59:52,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:59:52,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:59:52,659 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:59:52,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:59:52,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:59:52,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:59:52,676 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:59:52,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:59:52,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:59:52,677 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:59:52,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:59:52,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:59:52,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:59:52,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:59:52,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:59:52,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:59:52,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:59:52,679 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 17:59:52,680 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 17:59:52,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:59:52,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:59:52,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:59:52,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:59:52,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:59:52,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:59:52,682 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:59:52,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:59:52,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:59:52,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:59:52,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:59:52,683 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 17:59:52,684 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:59:52,684 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 17:59:52,684 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 17:59:52,684 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 -> 533380071f86516c77adeaa4e61a531bca0d059c 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:59:52,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:59:52,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:59:52,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:59:52,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:59:52,768 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:59:52,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0877_true-unreach-call.c [2018-09-21 17:59:53,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6327fe5e/4129d1870cb84d0c9ea37d592f4479d7/FLAG8b22362fa [2018-09-21 17:59:53,360 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:59:53,361 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0877_true-unreach-call.c [2018-09-21 17:59:53,372 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6327fe5e/4129d1870cb84d0c9ea37d592f4479d7/FLAG8b22362fa [2018-09-21 17:59:53,387 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6327fe5e/4129d1870cb84d0c9ea37d592f4479d7 [2018-09-21 17:59:53,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:59:53,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:59:53,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:59:53,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:59:53,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:59:53,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:59:53" (1/1) ... [2018-09-21 17:59:53,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e21c4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:53, skipping insertion in model container [2018-09-21 17:59:53,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:59:53" (1/1) ... [2018-09-21 17:59:53,421 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:59:53,948 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:59:53,985 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 17:59:54,180 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:59:54,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54 WrapperNode [2018-09-21 17:59:54,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 17:59:54,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 17:59:54,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 17:59:54,254 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 17:59:54,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (1/1) ... [2018-09-21 17:59:54,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 17:59:54,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 17:59:54,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 17:59:54,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 17:59:54,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59: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:59:54,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 17:59:54,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 17:59:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-21 17:59:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-21 17:59:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-21 17:59:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-21 17:59:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-21 17:59:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-21 17:59:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-21 17:59:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 17:59:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 17:59:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 17:59:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 17:59:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-21 17:59:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-21 17:59:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-21 17:59:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-21 17:59:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-21 17:59:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-21 17:59:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-21 17:59:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 17:59:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 17:59:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 17:59:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 17:59:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-21 17:59:55,163 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:55,699 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:55,734 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:56,287 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:56,299 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:57,538 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:58,843 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:58,978 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:58,992 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,049 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,067 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,093 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,265 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,305 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:59:59,340 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:00,081 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:00,093 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:00,135 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:02,586 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:02,645 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:05,354 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:07,624 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:09,910 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:12,031 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:14,208 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:14,245 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:14,297 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:14,421 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:14,476 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:16,617 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:24,229 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:24,243 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:24,287 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:24,365 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:24,739 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:27,779 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:27,806 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:27,861 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:42,499 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:42,967 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:42,981 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:43,009 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:46,893 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:46,985 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:47,001 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:00:49,075 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:00:49,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:00:49 BoogieIcfgContainer [2018-09-21 18:00:49,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:00:49,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:00:49,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:00:49,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:00:49,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 05:59:53" (1/3) ... [2018-09-21 18:00:49,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640538a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:00:49, skipping insertion in model container [2018-09-21 18:00:49,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:59:54" (2/3) ... [2018-09-21 18:00:49,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640538a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:00:49, skipping insertion in model container [2018-09-21 18:00:49,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:00:49" (3/3) ... [2018-09-21 18:00:49,084 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0877_true-unreach-call.c [2018-09-21 18:00:49,093 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:00:49,101 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:00:49,141 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:00:49,141 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:00:49,142 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:00:49,142 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:00:49,142 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:00:49,142 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:00:49,142 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:00:49,142 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:00:49,142 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:00:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states. [2018-09-21 18:00:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-21 18:00:49,195 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:00:49,196 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] [2018-09-21 18:00:49,199 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:00:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1286656335, now seen corresponding path program 1 times [2018-09-21 18:00:49,209 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:00:49,210 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 18:00:49,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:00:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:00:49,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:00:49,498 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:49,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:00:49,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:00:49,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:00:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:00:49,550 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:00:49,551 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:00:49,554 INFO L87 Difference]: Start difference. First operand 523 states. Second operand 2 states. [2018-09-21 18:00:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:00:49,627 INFO L93 Difference]: Finished difference Result 523 states and 606 transitions. [2018-09-21 18:00:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:00:49,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-09-21 18:00:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:00:49,651 INFO L225 Difference]: With dead ends: 523 [2018-09-21 18:00:49,651 INFO L226 Difference]: Without dead ends: 518 [2018-09-21 18:00:49,653 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 18:00:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-09-21 18:00:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-09-21 18:00:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-21 18:00:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-09-21 18:00:49,739 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 33 [2018-09-21 18:00:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:00:49,740 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-09-21 18:00:49,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:00:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-09-21 18:00:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-21 18:00:49,745 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:00:49,745 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] [2018-09-21 18:00:49,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:00:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1267609784, now seen corresponding path program 1 times [2018-09-21 18:00:49,747 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:00:49,747 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 18:00:49,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:00:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:00:50,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:00:50,117 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:50,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:00:50,136 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:00:50,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-21 18:00:50,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-21 18:00:50,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-21 18:00:50,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 18:00:50,141 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 3 states. [2018-09-21 18:00:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:00:50,215 INFO L93 Difference]: Finished difference Result 519 states and 600 transitions. [2018-09-21 18:00:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-21 18:00:50,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-09-21 18:00:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:00:50,221 INFO L225 Difference]: With dead ends: 519 [2018-09-21 18:00:50,221 INFO L226 Difference]: Without dead ends: 518 [2018-09-21 18:00:50,222 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 18:00:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-09-21 18:00:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-09-21 18:00:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-21 18:00:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 599 transitions. [2018-09-21 18:00:50,251 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 599 transitions. Word has length 92 [2018-09-21 18:00:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:00:50,253 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 599 transitions. [2018-09-21 18:00:50,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-21 18:00:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 599 transitions. [2018-09-21 18:00:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-21 18:00:50,256 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:00:50,256 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] [2018-09-21 18:00:50,256 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:00:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -940493907, now seen corresponding path program 1 times [2018-09-21 18:00:50,257 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:00:50,257 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 18:00:50,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:00:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:00:50,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:00:50,765 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:00:50,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 11 treesize of output 10 [2018-09-21 18:00:50,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:00:50,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:00:50,820 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:50,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:00:50,893 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:00:50,906 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:00:50,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:00:50,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:00:50,973 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:50,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:00:51,263 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:51,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:00:51,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:00:51,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:00:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:00:51,286 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:00:51,286 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:00:51,286 INFO L87 Difference]: Start difference. First operand 518 states and 599 transitions. Second operand 9 states. [2018-09-21 18:00:52,021 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:00:53,404 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:01:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:01:13,304 INFO L93 Difference]: Finished difference Result 526 states and 609 transitions. [2018-09-21 18:01:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:01:13,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-09-21 18:01:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:01:13,312 INFO L225 Difference]: With dead ends: 526 [2018-09-21 18:01:13,312 INFO L226 Difference]: Without dead ends: 524 [2018-09-21 18:01:13,313 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 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:01:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-09-21 18:01:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-09-21 18:01:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-21 18:01:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 598 transitions. [2018-09-21 18:01:13,337 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 598 transitions. Word has length 97 [2018-09-21 18:01:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:01:13,338 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 598 transitions. [2018-09-21 18:01:13,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:01:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 598 transitions. [2018-09-21 18:01:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-21 18:01:13,341 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:01:13,341 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] [2018-09-21 18:01:13,341 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:01:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1330485679, now seen corresponding path program 1 times [2018-09-21 18:01:13,343 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:01:13,344 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:01:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:01:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:01:13,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:01:13,970 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:13,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:13,976 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:13,989 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:14,007 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:14,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,167 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:14,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:01:14,510 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:14,513 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:14,515 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:14,550 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:14,572 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:14,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,648 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:14,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:01:14,721 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:14,762 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:14,787 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:14,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:14,849 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:14,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:01:15,333 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2018-09-21 18:01:15,472 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:15,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:01:15,492 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:01:15,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-21 18:01:15,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-21 18:01:15,493 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-21 18:01:15,496 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:01:15,496 INFO L87 Difference]: Start difference. First operand 518 states and 598 transitions. Second operand 12 states. [2018-09-21 18:01:16,717 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:01:17,433 WARN L178 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:01:18,220 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:01:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:01:51,443 INFO L93 Difference]: Finished difference Result 528 states and 610 transitions. [2018-09-21 18:01:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:01:51,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-09-21 18:01:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:01:51,449 INFO L225 Difference]: With dead ends: 528 [2018-09-21 18:01:51,449 INFO L226 Difference]: Without dead ends: 526 [2018-09-21 18:01:51,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:01:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-09-21 18:01:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 518. [2018-09-21 18:01:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-09-21 18:01:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 597 transitions. [2018-09-21 18:01:51,466 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 597 transitions. Word has length 99 [2018-09-21 18:01:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:01:51,467 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 597 transitions. [2018-09-21 18:01:51,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-21 18:01:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 597 transitions. [2018-09-21 18:01:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-21 18:01:51,470 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:01:51,471 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] [2018-09-21 18:01:51,471 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:01:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 887272274, now seen corresponding path program 1 times [2018-09-21 18:01:51,472 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:01:51,472 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:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:01:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:01:51,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:01:52,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:52,299 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:52,301 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:52,420 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:52,442 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-09-21 18:01:52,443 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:52,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:52,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:52,540 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:52,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-09-21 18:01:52,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:52,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:52,922 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:52,955 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:52,981 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:52,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:53,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:53,185 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:53,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-09-21 18:01:53,325 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:53,432 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:53,457 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-09-21 18:01:53,459 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:53,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:53,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:53,779 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:53,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-09-21 18:01:54,084 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:54,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:54,086 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:54,097 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:54,122 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:54,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:54,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:54,207 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:54,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-09-21 18:01:54,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:54,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:01:54,810 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:54,836 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:54,864 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:54,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:54,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:55,016 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:55,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-09-21 18:01:55,201 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:55,251 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:01:55,285 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:55,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:01:55,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:01:55,492 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:55,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:35 [2018-09-21 18:01:56,605 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-09-21 18:01:56,675 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:56,676 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:01:56,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:01:56,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:01:56,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:01:56,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:01:56,691 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:01:56,691 INFO L87 Difference]: Start difference. First operand 518 states and 597 transitions. Second operand 20 states. [2018-09-21 18:01:59,121 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:01:59,473 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:02:02,105 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-21 18:02:02,607 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:02:03,152 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-21 18:02:03,748 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:02:04,265 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-21 18:02:05,073 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:02:06,043 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:02:09,268 WARN L178 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-09-21 18:03:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:03:31,722 INFO L93 Difference]: Finished difference Result 541 states and 620 transitions. [2018-09-21 18:03:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:03:31,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-09-21 18:03:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:03:31,727 INFO L225 Difference]: With dead ends: 541 [2018-09-21 18:03:31,728 INFO L226 Difference]: Without dead ends: 538 [2018-09-21 18:03:31,729 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=199, Invalid=1282, Unknown=1, NotChecked=0, Total=1482 [2018-09-21 18:03:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-09-21 18:03:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 517. [2018-09-21 18:03:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-09-21 18:03:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 595 transitions. [2018-09-21 18:03:31,746 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 595 transitions. Word has length 99 [2018-09-21 18:03:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:03:31,749 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 595 transitions. [2018-09-21 18:03:31,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:03:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 595 transitions. [2018-09-21 18:03:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-21 18:03:31,756 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:03:31,756 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] [2018-09-21 18:03:31,756 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:03:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1282211791, now seen corresponding path program 1 times [2018-09-21 18:03:31,757 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:03:31,757 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:03:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:03:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:03:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:03:32,298 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:32,305 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:32,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,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:03:32,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:03:32,589 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:32,637 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:32,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,713 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:32,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:03:32,836 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 12 treesize of output 9 [2018-09-21 18:03:32,843 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 9 treesize of output 8 [2018-09-21 18:03:32,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:32,883 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:32,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-09-21 18:03:32,959 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 25 treesize of output 20 [2018-09-21 18:03:32,971 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:32,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-09-21 18:03:32,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:33,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:33,040 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:33,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-09-21 18:03:33,154 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:33,198 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:33,227 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:33,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:33,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:33,424 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:33,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:46 [2018-09-21 18:03:34,295 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:03:34,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:34,625 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:34,626 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:34,635 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:34,656 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:34,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:34,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:34,698 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:34,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:03:35,336 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:35,337 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:35,338 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:35,348 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:35,396 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:35,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:35,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:35,500 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:35,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:03:35,723 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:35,730 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:35,735 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:35,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:35,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:35,768 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:35,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:03:37,022 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:03:37,022 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:03:37,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:03:37,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:03:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:03:37,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:03:37,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:03:37,044 INFO L87 Difference]: Start difference. First operand 517 states and 595 transitions. Second operand 23 states. [2018-09-21 18:03:38,721 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:03:40,437 WARN L178 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-09-21 18:03:41,136 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-09-21 18:03:41,955 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-09-21 18:03:42,676 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-09-21 18:03:47,275 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-09-21 18:03:48,327 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-09-21 18:03:51,895 WARN L178 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:03:54,488 WARN L178 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:03:56,845 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-09-21 18:04:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:04:42,855 INFO L93 Difference]: Finished difference Result 665 states and 783 transitions. [2018-09-21 18:04:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-21 18:04:42,856 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-09-21 18:04:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:04:42,860 INFO L225 Difference]: With dead ends: 665 [2018-09-21 18:04:42,860 INFO L226 Difference]: Without dead ends: 663 [2018-09-21 18:04:42,862 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2018-09-21 18:04:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-09-21 18:04:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 520. [2018-09-21 18:04:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-21 18:04:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 600 transitions. [2018-09-21 18:04:42,878 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 600 transitions. Word has length 102 [2018-09-21 18:04:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:04:42,878 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 600 transitions. [2018-09-21 18:04:42,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:04:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 600 transitions. [2018-09-21 18:04:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-21 18:04:42,881 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:04:42,882 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:04:42,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:04:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1732560217, now seen corresponding path program 1 times [2018-09-21 18:04:42,884 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:04:42,884 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:04:42,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:04:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:04:43,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:04:43,359 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,366 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,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,381 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,425 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,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:04:43,516 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,526 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,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,547 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,605 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,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:04:43,731 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 12 treesize of output 9 [2018-09-21 18:04:43,738 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 9 treesize of output 8 [2018-09-21 18:04:43,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,746 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,777 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:04:43,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-09-21 18:04:43,859 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 25 treesize of output 20 [2018-09-21 18:04:43,868 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:43,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-09-21 18:04:43,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:43,907 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,942 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:04:43,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-09-21 18:04:44,056 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:04:44,068 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:44,078 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:04:44,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:44,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:44,132 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:04:44,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:46 [2018-09-21 18:04:45,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:45,597 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:45,598 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:04:45,607 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:45,628 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:04:45,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:45,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:45,671 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:45,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:04:46,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:46,367 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:04:46,368 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:04:46,380 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:46,401 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:04:46,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:46,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:46,493 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:04:46,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:04:46,707 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:04:46,714 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:04:46,719 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:04:46,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:04:46,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:04:46,751 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:46,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:04:47,742 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:47,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:47,758 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:47,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:04:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:04:47,760 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:04:47,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:04:47,760 INFO L87 Difference]: Start difference. First operand 520 states and 600 transitions. Second operand 22 states. [2018-09-21 18:04:50,070 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-09-21 18:04:50,608 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-09-21 18:04:51,230 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-21 18:04:51,876 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-09-21 18:04:53,754 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-09-21 18:04:54,530 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-09-21 18:04:58,471 WARN L178 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:05:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:05:32,267 INFO L93 Difference]: Finished difference Result 621 states and 711 transitions. [2018-09-21 18:05:32,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-21 18:05:32,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2018-09-21 18:05:32,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:05:32,273 INFO L225 Difference]: With dead ends: 621 [2018-09-21 18:05:32,273 INFO L226 Difference]: Without dead ends: 619 [2018-09-21 18:05:32,274 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2018-09-21 18:05:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-09-21 18:05:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 517. [2018-09-21 18:05:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-09-21 18:05:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 594 transitions. [2018-09-21 18:05:32,289 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 594 transitions. Word has length 103 [2018-09-21 18:05:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:05:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 594 transitions. [2018-09-21 18:05:32,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:05:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 594 transitions. [2018-09-21 18:05:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-21 18:05:32,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:05:32,293 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:05:32,293 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:05:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907538, now seen corresponding path program 1 times [2018-09-21 18:05:32,295 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:05:32,295 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:05:32,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:05:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:05:33,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:05:33,457 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:33,464 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:33,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:33,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:33,490 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:33,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:05:33,533 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:33,538 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:33,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:33,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:33,556 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:33,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:05:33,814 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:33,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:05:33,847 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:05:33,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:05:33,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:05:33,848 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:05:33,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:05:33,848 INFO L87 Difference]: Start difference. First operand 517 states and 594 transitions. Second operand 9 states. [2018-09-21 18:06:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:04,760 INFO L93 Difference]: Finished difference Result 590 states and 692 transitions. [2018-09-21 18:06:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:06:04,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-09-21 18:06:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:04,764 INFO L225 Difference]: With dead ends: 590 [2018-09-21 18:06:04,764 INFO L226 Difference]: Without dead ends: 499 [2018-09-21 18:06:04,765 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:06:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-09-21 18:06:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 462. [2018-09-21 18:06:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-09-21 18:06:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 523 transitions. [2018-09-21 18:06:04,778 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 523 transitions. Word has length 103 [2018-09-21 18:06:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:04,778 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 523 transitions. [2018-09-21 18:06:04,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:06:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 523 transitions. [2018-09-21 18:06:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:06:04,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:04,782 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, 1, 1] [2018-09-21 18:06:04,782 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 764488967, now seen corresponding path program 1 times [2018-09-21 18:06:04,783 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:04,783 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:06:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:05,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:05,129 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:05,149 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:05,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,265 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:05,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:05,364 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:05,380 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:05,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,446 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:05,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:05,533 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:06:05,539 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:06:05,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:05,569 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:05,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-21 18:06:05,639 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:06:05,651 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:06:05,657 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:06:05,658 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:06:05,674 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:06:05,698 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:06:05,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-09-21 18:06:06,657 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:06,663 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:06,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:06,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:06,690 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:06,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:06,902 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:06,907 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:06,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:06,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:06,922 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:06,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:07,901 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:07,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:07,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:07,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:06:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:06:07,916 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:06:07,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:06:07,917 INFO L87 Difference]: Start difference. First operand 462 states and 523 transitions. Second operand 20 states. [2018-09-21 18:06:10,126 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:06:12,761 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-09-21 18:06:13,308 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:06:15,423 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:06:16,142 WARN L178 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-21 18:06:20,292 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:06:20,988 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-21 18:06:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:55,082 INFO L93 Difference]: Finished difference Result 805 states and 917 transitions. [2018-09-21 18:06:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-21 18:06:55,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-09-21 18:06:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:55,098 INFO L225 Difference]: With dead ends: 805 [2018-09-21 18:06:55,098 INFO L226 Difference]: Without dead ends: 609 [2018-09-21 18:06:55,099 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2018-09-21 18:06:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-09-21 18:06:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 491. [2018-09-21 18:06:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-21 18:06:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 567 transitions. [2018-09-21 18:06:55,122 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 567 transitions. Word has length 105 [2018-09-21 18:06:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:55,122 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 567 transitions. [2018-09-21 18:06:55,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:06:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 567 transitions. [2018-09-21 18:06:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:06:55,126 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:55,126 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, 1, 1] [2018-09-21 18:06:55,126 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash 851158527, now seen corresponding path program 1 times [2018-09-21 18:06:55,127 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:55,127 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:55,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:55,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:55,836 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:06:55,837 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:06:55,838 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:06:55,847 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:06:55,869 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:06:55,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:55,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:55,918 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:55,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:06:56,242 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:06:56,243 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:06:56,245 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:06:56,269 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:06:56,291 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:06:56,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:56,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:56,437 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:06:56,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:06:56,546 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:06:56,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:06:56,561 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:06:56,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:56,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:56,599 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:56,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:06:57,365 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:57,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:57,381 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:57,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-21 18:06:57,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-21 18:06:57,382 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-21 18:06:57,382 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:06:57,382 INFO L87 Difference]: Start difference. First operand 491 states and 567 transitions. Second operand 16 states. [2018-09-21 18:07:01,427 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:07:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:19,541 INFO L93 Difference]: Finished difference Result 499 states and 575 transitions. [2018-09-21 18:07:19,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-21 18:07:19,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2018-09-21 18:07:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:19,545 INFO L225 Difference]: With dead ends: 499 [2018-09-21 18:07:19,546 INFO L226 Difference]: Without dead ends: 493 [2018-09-21 18:07:19,546 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2018-09-21 18:07:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-09-21 18:07:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2018-09-21 18:07:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-21 18:07:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 566 transitions. [2018-09-21 18:07:19,561 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 566 transitions. Word has length 105 [2018-09-21 18:07:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:19,562 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 566 transitions. [2018-09-21 18:07:19,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-21 18:07:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 566 transitions. [2018-09-21 18:07:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:07:19,566 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:19,566 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, 1, 1] [2018-09-21 18:07:19,567 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash 913198141, now seen corresponding path program 1 times [2018-09-21 18:07:19,569 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:19,569 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:07:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:19,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:19,928 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:19,935 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:19,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:19,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:19,995 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:19,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:20,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:07:20,048 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:20,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:20,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:20,066 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:20,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:20,231 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:20,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:20,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:20,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:07:20,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:07:20,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:07:20,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:07:20,249 INFO L87 Difference]: Start difference. First operand 491 states and 566 transitions. Second operand 8 states. [2018-09-21 18:07:21,007 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:07:21,602 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-21 18:07:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:33,776 INFO L93 Difference]: Finished difference Result 502 states and 579 transitions. [2018-09-21 18:07:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:07:33,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-09-21 18:07:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:33,780 INFO L225 Difference]: With dead ends: 502 [2018-09-21 18:07:33,780 INFO L226 Difference]: Without dead ends: 493 [2018-09-21 18:07:33,781 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:07:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-09-21 18:07:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 486. [2018-09-21 18:07:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-09-21 18:07:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 556 transitions. [2018-09-21 18:07:33,795 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 556 transitions. Word has length 105 [2018-09-21 18:07:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:33,796 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 556 transitions. [2018-09-21 18:07:33,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:07:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 556 transitions. [2018-09-21 18:07:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-21 18:07:33,800 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:33,800 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, 1, 1, 1] [2018-09-21 18:07:33,801 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -321345157, now seen corresponding path program 1 times [2018-09-21 18:07:33,802 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:33,802 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:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:34,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:34,184 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:34,191 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:34,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,219 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:34,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:34,259 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:34,264 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:34,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,281 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:34,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:34,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:07:34,376 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:34,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:34,404 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:34,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-21 18:07:34,479 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:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:07:34,497 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:34,498 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:34,513 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:34,532 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:34,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-09-21 18:07:35,627 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:35,634 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:35,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,663 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:35,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:35,875 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:35,880 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:35,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:35,896 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:35,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:36,665 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:36,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:36,680 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:36,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:07:36,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:07:36,681 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:07:36,681 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:07:36,681 INFO L87 Difference]: Start difference. First operand 486 states and 556 transitions. Second operand 19 states. [2018-09-21 18:07:42,717 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:07:43,432 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-21 18:08:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:10,851 INFO L93 Difference]: Finished difference Result 765 states and 855 transitions. [2018-09-21 18:08:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-21 18:08:10,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-09-21 18:08:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:10,855 INFO L225 Difference]: With dead ends: 765 [2018-09-21 18:08:10,855 INFO L226 Difference]: Without dead ends: 568 [2018-09-21 18:08:10,856 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 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:08:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-09-21 18:08:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 439. [2018-09-21 18:08:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-09-21 18:08:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 488 transitions. [2018-09-21 18:08:10,868 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 488 transitions. Word has length 106 [2018-09-21 18:08:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:10,868 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 488 transitions. [2018-09-21 18:08:10,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:08:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 488 transitions. [2018-09-21 18:08:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-21 18:08:10,872 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:10,873 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] [2018-09-21 18:08:10,873 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2054923905, now seen corresponding path program 1 times [2018-09-21 18:08:10,874 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:10,874 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) [2018-09-21 18:08:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:08:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:12,037 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:12,045 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:12,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:12,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:12,067 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:12,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:12,113 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:12,119 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:12,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:12,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:12,133 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:12,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:12,502 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:12,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:12,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:12,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:08:12,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:08:12,533 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:08:12,533 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:08:12,533 INFO L87 Difference]: Start difference. First operand 439 states and 488 transitions. Second operand 10 states. [2018-09-21 18:08:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:25,207 INFO L93 Difference]: Finished difference Result 442 states and 490 transitions. [2018-09-21 18:08:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:08:25,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2018-09-21 18:08:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:25,210 INFO L225 Difference]: With dead ends: 442 [2018-09-21 18:08:25,210 INFO L226 Difference]: Without dead ends: 430 [2018-09-21 18:08:25,211 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:08:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-09-21 18:08:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 417. [2018-09-21 18:08:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-09-21 18:08:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 451 transitions. [2018-09-21 18:08:25,221 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 451 transitions. Word has length 130 [2018-09-21 18:08:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:25,223 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 451 transitions. [2018-09-21 18:08:25,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:08:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 451 transitions. [2018-09-21 18:08:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-21 18:08:25,227 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:25,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:08:25,227 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash -433860709, now seen corresponding path program 1 times [2018-09-21 18:08:25,228 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:25,228 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:25,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:08:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:29,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:29,305 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:29,312 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:29,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:29,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:29,337 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:29,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:29,390 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:29,395 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:29,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:29,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:29,410 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:29,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:29,974 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:29,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:30,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:30,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:08:30,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:08:30,046 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:08:30,046 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:08:30,046 INFO L87 Difference]: Start difference. First operand 417 states and 451 transitions. Second operand 10 states. [2018-09-21 18:08:30,646 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:08:32,007 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:08:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:37,458 INFO L93 Difference]: Finished difference Result 396 states and 431 transitions. [2018-09-21 18:08:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:08:37,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-09-21 18:08:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:37,461 INFO L225 Difference]: With dead ends: 396 [2018-09-21 18:08:37,461 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:08:37,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 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:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:08:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:08:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:08:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:08:37,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2018-09-21 18:08:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:37,462 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:08:37,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:08:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:08:37,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:08:37,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:08:37 BoogieIcfgContainer [2018-09-21 18:08:37,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:08:37,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:08:37,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:08:37,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:08:37,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:00:49" (3/4) ... [2018-09-21 18:08:37,485 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:08:37,497 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-09-21 18:08:37,497 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2018-09-21 18:08:37,498 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-21 18:08:37,498 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:08:37,498 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure scalbn_double [2018-09-21 18:08:37,498 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure copysign_double [2018-09-21 18:08:37,498 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-09-21 18:08:37,499 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_pow [2018-09-21 18:08:37,499 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:08:37,547 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2018-09-21 18:08:37,551 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-09-21 18:08:37,552 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-21 18:08:37,557 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-21 18:08:37,762 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:08:37,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:08:37,764 INFO L168 Benchmark]: Toolchain (without parser) took 524373.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:37,765 INFO L168 Benchmark]: CDTParser took 0.22 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:37,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.90 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:37,766 INFO L168 Benchmark]: Boogie Preprocessor took 281.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:37,766 INFO L168 Benchmark]: RCFGBuilder took 54541.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 131.8 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:37,766 INFO L168 Benchmark]: TraceAbstraction took 468399.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 983.7 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:08:37,769 INFO L168 Benchmark]: Witness Printer took 285.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:37,773 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.22 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 857.90 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 281.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 54541.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 131.8 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 468399.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 983.7 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 285.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 597]: 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 10 procedures, 523 locations, 1 error locations. SAFE Result, 468.3s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 431.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7975 SDtfs, 8634 SDslu, 71512 SDs, 0 SdLazy, 10549 SolverSat, 244 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 354.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1614 GetRequests, 1283 SyntacticMatches, 6 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 63.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred 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, 14 MinimizatonAttempts, 586 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1444 ConstructedInterpolants, 471 QuantifiedInterpolants, 1474269 SizeOfPredicates, 175 NumberOfNonLiveVariables, 4246 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 52/52 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...