/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0880_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/float_req_bl_0880_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 52904116f7347e94652e9629ac3cb5dac2d15245 --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/float_req_bl_0880_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 52904116f7347e94652e9629ac3cb5dac2d15245 --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 18:31:03,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:31:03,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:31:03,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:31:03,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:31:03,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:31:03,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:31:03,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:31:03,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:31:03,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:31:03,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:31:03,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:31:03,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:31:03,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:31:03,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:31:03,855 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:31:03,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:31:03,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:31:03,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:31:03,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:31:03,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:31:03,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:31:03,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:31:03,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:31:03,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:31:03,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:31:03,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:31:03,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:31:03,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:31:03,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:31:03,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:31:03,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:31:03,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:31:03,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:31:03,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:31:03,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:31:03,893 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:31:03,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:31:03,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:31:03,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:31:03,922 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:31:03,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:31:03,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:31:03,924 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:31:03,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:31:03,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:31:03,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:31:03,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:31:03,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:31:03,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:31:03,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:31:03,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:31:03,929 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:31:03,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:31:03,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:31:03,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:31:03,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:31:03,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:31:03,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:31:03,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:31:03,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:31:03,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:31:03,930 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:31:03,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:31:03,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:31:03,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:31:03,934 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 -> 52904116f7347e94652e9629ac3cb5dac2d15245 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 18:31:03,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:31:04,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:31:04,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:31:04,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:31:04,016 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:31:04,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0880_true-unreach-call.c [2018-09-21 18:31:04,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c95d6ad1/24fc30e4e7dc4408af2ec9577a448980/FLAG1c0a3b738 [2018-09-21 18:31:04,554 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:31:04,555 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0880_true-unreach-call.c [2018-09-21 18:31:04,573 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c95d6ad1/24fc30e4e7dc4408af2ec9577a448980/FLAG1c0a3b738 [2018-09-21 18:31:04,589 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c95d6ad1/24fc30e4e7dc4408af2ec9577a448980 [2018-09-21 18:31:04,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:31:04,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:31:04,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:31:04,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:31:04,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:31:04,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:31:04" (1/1) ... [2018-09-21 18:31:04,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f661768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:04, skipping insertion in model container [2018-09-21 18:31:04,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:31:04" (1/1) ... [2018-09-21 18:31:04,620 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:31:04,977 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$38(StandardFunctionHandler.java:261) 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 18:31:04,982 INFO L168 Benchmark]: Toolchain (without parser) took 388.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.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 18:31:04,984 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 18:31:04,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.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 18:31:04,987 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 383.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.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 18:31:07,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:31:07,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:31:07,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:31:07,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:31:07,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:31:07,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:31:07,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:31:07,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:31:07,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:31:07,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:31:07,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:31:07,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:31:07,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:31:07,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:31:07,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:31:07,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:31:07,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:31:07,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:31:07,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:31:07,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:31:07,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:31:07,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:31:07,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:31:07,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:31:07,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:31:07,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:31:07,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:31:07,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:31:07,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:31:07,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:31:07,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:31:07,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:31:07,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:31:07,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:31:07,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:31:07,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:31:07,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:31:07,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:31:07,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:31:07,274 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:31:07,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:31:07,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:31:07,275 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:31:07,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:31:07,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:31:07,276 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:31:07,277 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:31:07,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:31:07,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:31:07,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:31:07,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:31:07,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:31:07,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:31:07,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:31:07,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:31:07,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:31:07,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:31:07,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:31:07,279 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:31:07,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:31:07,279 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:31:07,280 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:31:07,280 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 -> 52904116f7347e94652e9629ac3cb5dac2d15245 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 18:31:07,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:31:07,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:31:07,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:31:07,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:31:07,359 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:31:07,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0880_true-unreach-call.c [2018-09-21 18:31:07,738 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52031f2f1/7ce038065f114b06b0883143fc417076/FLAGe8a7997b9 [2018-09-21 18:31:07,947 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:31:07,947 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0880_true-unreach-call.c [2018-09-21 18:31:07,961 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52031f2f1/7ce038065f114b06b0883143fc417076/FLAGe8a7997b9 [2018-09-21 18:31:07,977 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52031f2f1/7ce038065f114b06b0883143fc417076 [2018-09-21 18:31:07,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:31:07,985 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:31:07,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:31:07,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:31:07,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:31:07,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:31:07" (1/1) ... [2018-09-21 18:31:07,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c97e44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:07, skipping insertion in model container [2018-09-21 18:31:07,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:31:07" (1/1) ... [2018-09-21 18:31:08,010 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:31:08,514 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:31:08,544 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:31:08,735 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:31:08,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08 WrapperNode [2018-09-21 18:31:08,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:31:08,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:31:08,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:31:08,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:31:08,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:08,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:08,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:08,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:08,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:09,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:09,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (1/1) ... [2018-09-21 18:31:09,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:31:09,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:31:09,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:31:09,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:31:09,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (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 18:31:09,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:31:09,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:31:09,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_float [2018-09-21 18:31:09,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-21 18:31:09,163 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2018-09-21 18:31:09,163 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2018-09-21 18:31:09,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:31:09,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_powf [2018-09-21 18:31:09,164 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-09-21 18:31:09,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isinteger_float [2018-09-21 18:31:09,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-21 18:31:09,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:31:09,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:31:09,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:31:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_float [2018-09-21 18:31:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:31:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-21 18:31:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:31:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:31:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:31:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-21 18:31:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-21 18:31:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2018-09-21 18:31:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2018-09-21 18:31:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:31:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_powf [2018-09-21 18:31:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-09-21 18:31:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure isinteger_float [2018-09-21 18:31:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-21 18:31:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:31:09,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:31:09,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:31:09,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:31:09,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-21 18:31:09,606 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,637 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,692 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,711 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,886 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,902 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,925 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:09,935 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:14,700 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:14,735 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:14,962 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:14,973 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:17,141 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:17,173 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:19,432 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:19,437 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:21,564 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:21,603 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:23,831 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:23,837 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:24,327 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:24,334 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:26,491 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:26,497 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:28,943 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:28,952 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:31,273 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:31,279 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:31,505 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:31,529 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:33,634 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:33,641 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:33,667 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:34,143 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:34,192 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:34,694 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:34,700 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:34,819 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:35,054 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:35,059 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:35,083 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:35,121 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:36,936 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:36,977 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:31:38,145 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:31:38,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:31:38 BoogieIcfgContainer [2018-09-21 18:31:38,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:31:38,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:31:38,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:31:38,152 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:31:38,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:31:07" (1/3) ... [2018-09-21 18:31:38,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bd321d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:31:38, skipping insertion in model container [2018-09-21 18:31:38,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:31:08" (2/3) ... [2018-09-21 18:31:38,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bd321d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:31:38, skipping insertion in model container [2018-09-21 18:31:38,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:31:38" (3/3) ... [2018-09-21 18:31:38,157 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0880_true-unreach-call.c [2018-09-21 18:31:38,170 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:31:38,181 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:31:38,236 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:31:38,237 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:31:38,238 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:31:38,238 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:31:38,238 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:31:38,238 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:31:38,238 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:31:38,239 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:31:38,239 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:31:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2018-09-21 18:31:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-21 18:31:38,305 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:38,307 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] [2018-09-21 18:31:38,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 779192166, now seen corresponding path program 1 times [2018-09-21 18:31:38,326 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:38,329 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:31:38,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:31:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:38,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:38,588 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:31:38,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:31:38,609 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:31:38,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:31:38,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:31:38,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:31:38,633 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:31:38,636 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 2 states. [2018-09-21 18:31:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:38,727 INFO L93 Difference]: Finished difference Result 618 states and 708 transitions. [2018-09-21 18:31:38,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:31:38,730 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-21 18:31:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:38,762 INFO L225 Difference]: With dead ends: 618 [2018-09-21 18:31:38,762 INFO L226 Difference]: Without dead ends: 613 [2018-09-21 18:31:38,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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:31:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-09-21 18:31:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2018-09-21 18:31:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-09-21 18:31:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 702 transitions. [2018-09-21 18:31:38,863 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 702 transitions. Word has length 27 [2018-09-21 18:31:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:38,863 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 702 transitions. [2018-09-21 18:31:38,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:31:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 702 transitions. [2018-09-21 18:31:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-21 18:31:38,868 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:38,868 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] [2018-09-21 18:31:38,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1046896687, now seen corresponding path program 1 times [2018-09-21 18:31:38,871 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:38,871 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:31:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:31:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:39,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:39,113 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:31:39,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:31:39,130 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:31:39,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:31:39,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:31:39,133 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:31:39,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:31:39,135 INFO L87 Difference]: Start difference. First operand 613 states and 702 transitions. Second operand 4 states. [2018-09-21 18:31:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:39,225 INFO L93 Difference]: Finished difference Result 617 states and 704 transitions. [2018-09-21 18:31:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-21 18:31:39,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-09-21 18:31:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:39,232 INFO L225 Difference]: With dead ends: 617 [2018-09-21 18:31:39,232 INFO L226 Difference]: Without dead ends: 613 [2018-09-21 18:31:39,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-21 18:31:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-09-21 18:31:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2018-09-21 18:31:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-09-21 18:31:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 700 transitions. [2018-09-21 18:31:39,277 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 700 transitions. Word has length 54 [2018-09-21 18:31:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:39,278 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 700 transitions. [2018-09-21 18:31:39,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:31:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 700 transitions. [2018-09-21 18:31:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-21 18:31:39,288 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:39,289 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] [2018-09-21 18:31:39,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -61408168, now seen corresponding path program 1 times [2018-09-21 18:31:39,290 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:39,290 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:31:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:31:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:39,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:39,951 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 11 treesize of output 8 [2018-09-21 18:31:39,969 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 8 treesize of output 7 [2018-09-21 18:31:39,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:39,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:40,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:40,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:40,090 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 29 treesize of output 21 [2018-09-21 18:31:40,094 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 21 treesize of output 9 [2018-09-21 18:31:40,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:40,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:40,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:40,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:57,647 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 8 [2018-09-21 18:32:08,960 WARN L178 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-21 18:32:11,311 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:32:11,312 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:11,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:11,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:32:11,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:32:11,338 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:32:11,338 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:32:11,339 INFO L87 Difference]: Start difference. First operand 613 states and 700 transitions. Second operand 17 states. [2018-09-21 18:33:00,991 WARN L178 SmtUtils]: Spent 5.67 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:33:13,493 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 27 [2018-09-21 18:33:30,478 WARN L178 SmtUtils]: Spent 3.20 s on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:33:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:35,527 INFO L93 Difference]: Finished difference Result 652 states and 742 transitions. [2018-09-21 18:33:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:33:35,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2018-09-21 18:33:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:35,537 INFO L225 Difference]: With dead ends: 652 [2018-09-21 18:33:35,537 INFO L226 Difference]: Without dead ends: 650 [2018-09-21 18:33:35,539 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 79.0s TimeCoverageRelationStatistics Valid=118, Invalid=871, Unknown=3, NotChecked=0, Total=992 [2018-09-21 18:33:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-09-21 18:33:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 624. [2018-09-21 18:33:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-09-21 18:33:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 712 transitions. [2018-09-21 18:33:35,569 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 712 transitions. Word has length 104 [2018-09-21 18:33:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:35,570 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 712 transitions. [2018-09-21 18:33:35,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:33:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 712 transitions. [2018-09-21 18:33:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-21 18:33:35,578 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:35,578 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] [2018-09-21 18:33:35,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -590327207, now seen corresponding path program 1 times [2018-09-21 18:33:35,580 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:35,581 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:33:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:33:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:36,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:36,193 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:33:36,242 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 11 treesize of output 8 [2018-09-21 18:33:36,247 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 8 treesize of output 7 [2018-09-21 18:33:36,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:36,294 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 29 treesize of output 21 [2018-09-21 18:33:36,298 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 21 treesize of output 9 [2018-09-21 18:33:36,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:36,814 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 11 treesize of output 8 [2018-09-21 18:33:36,820 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 8 treesize of output 7 [2018-09-21 18:33:36,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:33:36,969 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 29 treesize of output 21 [2018-09-21 18:33:36,974 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 21 treesize of output 9 [2018-09-21 18:33:36,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:33:37,218 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 11 treesize of output 8 [2018-09-21 18:33:37,224 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 8 treesize of output 7 [2018-09-21 18:33:37,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:33:37,383 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 29 treesize of output 21 [2018-09-21 18:33:37,388 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 21 treesize of output 9 [2018-09-21 18:33:37,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:37,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:33:38,343 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-21 18:33:38,390 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:33:38,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:38,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:38,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:33:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:33:38,406 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:33:38,407 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:33:38,407 INFO L87 Difference]: Start difference. First operand 624 states and 712 transitions. Second operand 22 states. [2018-09-21 18:33:49,961 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-21 18:33:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:53,235 INFO L93 Difference]: Finished difference Result 674 states and 768 transitions. [2018-09-21 18:33:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-21 18:33:53,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2018-09-21 18:33:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:53,242 INFO L225 Difference]: With dead ends: 674 [2018-09-21 18:33:53,243 INFO L226 Difference]: Without dead ends: 674 [2018-09-21 18:33:53,244 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2018-09-21 18:33:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-09-21 18:33:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 635. [2018-09-21 18:33:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-09-21 18:33:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 723 transitions. [2018-09-21 18:33:53,267 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 723 transitions. Word has length 104 [2018-09-21 18:33:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:53,268 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 723 transitions. [2018-09-21 18:33:53,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:33:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 723 transitions. [2018-09-21 18:33:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:33:53,270 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:53,270 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:33:53,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1724891272, now seen corresponding path program 1 times [2018-09-21 18:33:53,273 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:53,273 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:33:53,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:33:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:53,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:53,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 11 treesize of output 8 [2018-09-21 18:33:53,842 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 8 treesize of output 7 [2018-09-21 18:33:53,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:53,889 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 29 treesize of output 21 [2018-09-21 18:33:53,893 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 21 treesize of output 9 [2018-09-21 18:33:53,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:53,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:54,510 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 11 treesize of output 8 [2018-09-21 18:33:54,528 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 8 treesize of output 7 [2018-09-21 18:33:54,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:33:54,716 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 29 treesize of output 21 [2018-09-21 18:33:54,732 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 21 treesize of output 9 [2018-09-21 18:33:54,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:54,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:33:55,202 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 11 treesize of output 8 [2018-09-21 18:33:55,208 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 8 treesize of output 7 [2018-09-21 18:33:55,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:33:55,382 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 29 treesize of output 21 [2018-09-21 18:33:55,388 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 21 treesize of output 9 [2018-09-21 18:33:55,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:55,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:33:56,362 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-21 18:33:56,397 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:33:56,397 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:56,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:56,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:33:56,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:33:56,413 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:33:56,413 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:33:56,413 INFO L87 Difference]: Start difference. First operand 635 states and 723 transitions. Second operand 23 states. [2018-09-21 18:33:58,625 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-21 18:34:09,299 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-09-21 18:34:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:34:13,587 INFO L93 Difference]: Finished difference Result 698 states and 792 transitions. [2018-09-21 18:34:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-21 18:34:13,589 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 105 [2018-09-21 18:34:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:34:13,593 INFO L225 Difference]: With dead ends: 698 [2018-09-21 18:34:13,593 INFO L226 Difference]: Without dead ends: 698 [2018-09-21 18:34:13,595 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=231, Invalid=2319, Unknown=0, NotChecked=0, Total=2550 [2018-09-21 18:34:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-09-21 18:34:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 635. [2018-09-21 18:34:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-09-21 18:34:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 723 transitions. [2018-09-21 18:34:13,616 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 723 transitions. Word has length 105 [2018-09-21 18:34:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:34:13,617 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 723 transitions. [2018-09-21 18:34:13,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:34:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 723 transitions. [2018-09-21 18:34:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:34:13,620 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:34:13,620 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:34:13,620 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:34:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1769255232, now seen corresponding path program 1 times [2018-09-21 18:34:13,621 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:34:13,621 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:34:13,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:34:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:34:13,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:34:13,924 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 11 treesize of output 8 [2018-09-21 18:34:13,928 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 8 treesize of output 7 [2018-09-21 18:34:13,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:13,978 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 29 treesize of output 21 [2018-09-21 18:34:13,982 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 21 treesize of output 9 [2018-09-21 18:34:13,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:14,555 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 11 treesize of output 8 [2018-09-21 18:34:14,562 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 8 treesize of output 7 [2018-09-21 18:34:14,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:14,645 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 29 treesize of output 21 [2018-09-21 18:34:14,652 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 21 treesize of output 9 [2018-09-21 18:34:14,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:14,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:15,075 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:34:15,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:34:15,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:34:15,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:34:15,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:34:15,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:34:15,090 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:34:15,090 INFO L87 Difference]: Start difference. First operand 635 states and 723 transitions. Second operand 19 states. [2018-09-21 18:34:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:34:24,381 INFO L93 Difference]: Finished difference Result 677 states and 767 transitions. [2018-09-21 18:34:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-21 18:34:24,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2018-09-21 18:34:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:34:24,389 INFO L225 Difference]: With dead ends: 677 [2018-09-21 18:34:24,390 INFO L226 Difference]: Without dead ends: 668 [2018-09-21 18:34:24,391 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:34:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-09-21 18:34:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 635. [2018-09-21 18:34:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-09-21 18:34:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 722 transitions. [2018-09-21 18:34:24,410 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 722 transitions. Word has length 105 [2018-09-21 18:34:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:34:24,410 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 722 transitions. [2018-09-21 18:34:24,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:34:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 722 transitions. [2018-09-21 18:34:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:34:24,414 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:34:24,414 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:34:24,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:34:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -985876257, now seen corresponding path program 1 times [2018-09-21 18:34:24,415 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:34:24,415 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) [2018-09-21 18:34:24,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-21 18:34:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:34:24,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:34:24,702 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 11 treesize of output 8 [2018-09-21 18:34:24,707 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 8 treesize of output 7 [2018-09-21 18:34:24,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:24,752 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 29 treesize of output 21 [2018-09-21 18:34:24,761 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 21 treesize of output 9 [2018-09-21 18:34:24,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:24,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:25,310 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 11 treesize of output 8 [2018-09-21 18:34:25,319 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 8 treesize of output 7 [2018-09-21 18:34:25,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:34:25,470 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 29 treesize of output 21 [2018-09-21 18:34:25,483 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 21 treesize of output 9 [2018-09-21 18:34:25,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:34:25,746 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 11 treesize of output 8 [2018-09-21 18:34:25,751 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 8 treesize of output 7 [2018-09-21 18:34:25,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:34:25,899 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 29 treesize of output 21 [2018-09-21 18:34:25,904 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 21 treesize of output 9 [2018-09-21 18:34:25,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:25,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:34:26,689 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:34:26,689 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:34:26,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:34:26,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:34:26,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:34:26,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:34:26,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:34:26,703 INFO L87 Difference]: Start difference. First operand 635 states and 722 transitions. Second operand 22 states. [2018-09-21 18:34:37,257 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:34:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:34:40,937 INFO L93 Difference]: Finished difference Result 687 states and 781 transitions. [2018-09-21 18:34:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-21 18:34:40,942 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-09-21 18:34:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:34:40,946 INFO L225 Difference]: With dead ends: 687 [2018-09-21 18:34:40,946 INFO L226 Difference]: Without dead ends: 687 [2018-09-21 18:34:40,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2018-09-21 18:34:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-21 18:34:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 646. [2018-09-21 18:34:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-09-21 18:34:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 735 transitions. [2018-09-21 18:34:40,968 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 735 transitions. Word has length 105 [2018-09-21 18:34:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:34:40,968 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 735 transitions. [2018-09-21 18:34:40,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:34:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 735 transitions. [2018-09-21 18:34:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-21 18:34:40,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:34:40,970 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:34:40,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:34:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1797623904, now seen corresponding path program 1 times [2018-09-21 18:34:40,973 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:34:40,973 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:34:40,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:34:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:34:41,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:34:41,269 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 11 treesize of output 8 [2018-09-21 18:34:41,273 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 8 treesize of output 7 [2018-09-21 18:34:41,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:41,319 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 29 treesize of output 21 [2018-09-21 18:34:41,335 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 21 treesize of output 9 [2018-09-21 18:34:41,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:41,762 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 11 treesize of output 8 [2018-09-21 18:34:41,775 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 8 treesize of output 7 [2018-09-21 18:34:41,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:34:41,930 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 29 treesize of output 21 [2018-09-21 18:34:41,935 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 21 treesize of output 9 [2018-09-21 18:34:41,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:41,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:34:42,173 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 11 treesize of output 8 [2018-09-21 18:34:42,179 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 8 treesize of output 7 [2018-09-21 18:34:42,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:34:42,316 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 29 treesize of output 21 [2018-09-21 18:34:42,319 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 21 treesize of output 9 [2018-09-21 18:34:42,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:42,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:34:43,399 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 11 treesize of output 8 [2018-09-21 18:34:43,403 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 8 treesize of output 7 [2018-09-21 18:34:43,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:43,554 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 29 treesize of output 21 [2018-09-21 18:34:43,558 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 21 treesize of output 9 [2018-09-21 18:34:43,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:43,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:44,220 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:34:44,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:34:44,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:34:44,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-09-21 18:34:44,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-21 18:34:44,234 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-21 18:34:44,234 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-09-21 18:34:44,234 INFO L87 Difference]: Start difference. First operand 646 states and 735 transitions. Second operand 29 states. [2018-09-21 18:34:59,498 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:35:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:35:16,565 INFO L93 Difference]: Finished difference Result 723 states and 826 transitions. [2018-09-21 18:35:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-21 18:35:16,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-09-21 18:35:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:35:16,573 INFO L225 Difference]: With dead ends: 723 [2018-09-21 18:35:16,573 INFO L226 Difference]: Without dead ends: 721 [2018-09-21 18:35:16,575 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=273, Invalid=3633, Unknown=0, NotChecked=0, Total=3906 [2018-09-21 18:35:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-09-21 18:35:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 646. [2018-09-21 18:35:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-09-21 18:35:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 734 transitions. [2018-09-21 18:35:16,596 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 734 transitions. Word has length 106 [2018-09-21 18:35:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:35:16,596 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 734 transitions. [2018-09-21 18:35:16,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-21 18:35:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 734 transitions. [2018-09-21 18:35:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-21 18:35:16,599 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:35:16,601 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, 1, 1] [2018-09-21 18:35:16,601 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:35:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash 753482052, now seen corresponding path program 1 times [2018-09-21 18:35:16,602 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:35:16,602 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:35:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:35:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:35:16,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:35:16,960 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 11 treesize of output 8 [2018-09-21 18:35:16,966 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 8 treesize of output 7 [2018-09-21 18:35:16,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:16,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:35:17,054 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 29 treesize of output 21 [2018-09-21 18:35:17,059 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 21 treesize of output 9 [2018-09-21 18:35:17,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:35:17,205 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 11 treesize of output 8 [2018-09-21 18:35:17,210 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 8 treesize of output 7 [2018-09-21 18:35:17,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:35:17,319 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 29 treesize of output 21 [2018-09-21 18:35:17,324 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 21 treesize of output 9 [2018-09-21 18:35:17,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:35:17,940 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 11 treesize of output 8 [2018-09-21 18:35:17,948 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 8 treesize of output 7 [2018-09-21 18:35:17,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:17,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:35:18,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 29 treesize of output 21 [2018-09-21 18:35:18,125 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 21 treesize of output 9 [2018-09-21 18:35:18,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:35:18,424 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 11 treesize of output 8 [2018-09-21 18:35:18,432 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 8 treesize of output 7 [2018-09-21 18:35:18,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:35:18,591 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 29 treesize of output 21 [2018-09-21 18:35:18,598 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 21 treesize of output 9 [2018-09-21 18:35:18,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:18,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:35:19,413 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:35:19,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:35:19,426 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:35:19,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:35:19,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:35:19,427 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:35:19,427 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:35:19,427 INFO L87 Difference]: Start difference. First operand 646 states and 734 transitions. Second operand 23 states. [2018-09-21 18:35:26,142 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:35:30,992 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:35:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:35:54,108 INFO L93 Difference]: Finished difference Result 686 states and 780 transitions. [2018-09-21 18:35:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-21 18:35:54,109 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 108 [2018-09-21 18:35:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:35:54,112 INFO L225 Difference]: With dead ends: 686 [2018-09-21 18:35:54,113 INFO L226 Difference]: Without dead ends: 683 [2018-09-21 18:35:54,114 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=216, Invalid=2040, Unknown=0, NotChecked=0, Total=2256 [2018-09-21 18:35:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-09-21 18:35:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 645. [2018-09-21 18:35:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-09-21 18:35:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 731 transitions. [2018-09-21 18:35:54,133 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 731 transitions. Word has length 108 [2018-09-21 18:35:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:35:54,133 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 731 transitions. [2018-09-21 18:35:54,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:35:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 731 transitions. [2018-09-21 18:35:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-21 18:35:54,137 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:35:54,137 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, 1, 1, 1, 1] [2018-09-21 18:35:54,137 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:35:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1671433466, now seen corresponding path program 1 times [2018-09-21 18:35:54,138 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:35:54,138 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:35:54,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:35:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:35:54,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:35:54,430 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 11 treesize of output 8 [2018-09-21 18:35:54,435 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 8 treesize of output 7 [2018-09-21 18:35:54,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:35:54,468 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 29 treesize of output 21 [2018-09-21 18:35:54,470 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 21 treesize of output 9 [2018-09-21 18:35:54,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:54,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:35:54,583 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:35:54,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:35:54,602 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:35:54,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:35:54,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:35:54,603 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:35:54,603 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:35:54,603 INFO L87 Difference]: Start difference. First operand 645 states and 731 transitions. Second operand 8 states. [2018-09-21 18:35:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:35:58,904 INFO L93 Difference]: Finished difference Result 918 states and 1040 transitions. [2018-09-21 18:35:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:35:58,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-09-21 18:35:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:35:58,913 INFO L225 Difference]: With dead ends: 918 [2018-09-21 18:35:58,913 INFO L226 Difference]: Without dead ends: 599 [2018-09-21 18:35:58,913 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:35:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-21 18:35:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-09-21 18:35:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-09-21 18:35:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 671 transitions. [2018-09-21 18:35:58,934 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 671 transitions. Word has length 110 [2018-09-21 18:35:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:35:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 671 transitions. [2018-09-21 18:35:58,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:35:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 671 transitions. [2018-09-21 18:35:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-21 18:35:58,939 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:35:58,939 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, 1, 1, 1, 1, 1] [2018-09-21 18:35:58,939 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:35:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1731532887, now seen corresponding path program 1 times [2018-09-21 18:35:58,940 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:35:58,940 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:35:58,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:35:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:35:59,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:35:59,358 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:35:59,406 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 11 treesize of output 8 [2018-09-21 18:35:59,419 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 8 treesize of output 7 [2018-09-21 18:35:59,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:35:59,509 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 29 treesize of output 21 [2018-09-21 18:35:59,519 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 21 treesize of output 9 [2018-09-21 18:35:59,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:35:59,638 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 11 treesize of output 8 [2018-09-21 18:35:59,643 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 8 treesize of output 7 [2018-09-21 18:35:59,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:35:59,739 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 29 treesize of output 21 [2018-09-21 18:35:59,743 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 21 treesize of output 9 [2018-09-21 18:35:59,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:35:59,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:36:00,255 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 11 treesize of output 8 [2018-09-21 18:36:00,258 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 8 treesize of output 7 [2018-09-21 18:36:00,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:36:00,358 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 29 treesize of output 21 [2018-09-21 18:36:00,362 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 21 treesize of output 9 [2018-09-21 18:36:00,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:00,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:36:01,171 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:36:01,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:36:01,193 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:36:01,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:36:01,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:36:01,194 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:36:01,194 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:36:01,194 INFO L87 Difference]: Start difference. First operand 599 states and 671 transitions. Second operand 20 states. [2018-09-21 18:36:05,998 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:36:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:36:19,074 INFO L93 Difference]: Finished difference Result 771 states and 861 transitions. [2018-09-21 18:36:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-21 18:36:19,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-09-21 18:36:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:36:19,079 INFO L225 Difference]: With dead ends: 771 [2018-09-21 18:36:19,080 INFO L226 Difference]: Without dead ends: 771 [2018-09-21 18:36:19,084 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2018-09-21 18:36:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-09-21 18:36:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 617. [2018-09-21 18:36:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-09-21 18:36:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 697 transitions. [2018-09-21 18:36:19,102 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 697 transitions. Word has length 111 [2018-09-21 18:36:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:36:19,102 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 697 transitions. [2018-09-21 18:36:19,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:36:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 697 transitions. [2018-09-21 18:36:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-21 18:36:19,107 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:36:19,107 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, 1, 1, 1, 1, 1] [2018-09-21 18:36:19,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:36:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash 250114636, now seen corresponding path program 1 times [2018-09-21 18:36:19,108 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:36:19,108 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:36:19,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:36:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:36:19,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:36:19,421 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 11 treesize of output 8 [2018-09-21 18:36:19,425 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 8 treesize of output 7 [2018-09-21 18:36:19,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:36:19,468 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 29 treesize of output 21 [2018-09-21 18:36:19,471 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 21 treesize of output 9 [2018-09-21 18:36:19,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:19,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:36:20,074 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 11 treesize of output 8 [2018-09-21 18:36:20,082 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 8 treesize of output 7 [2018-09-21 18:36:20,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:36:20,251 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 29 treesize of output 21 [2018-09-21 18:36:20,259 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 21 treesize of output 9 [2018-09-21 18:36:20,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:36:20,508 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 11 treesize of output 8 [2018-09-21 18:36:20,512 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 8 treesize of output 7 [2018-09-21 18:36:20,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:36:20,678 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 29 treesize of output 21 [2018-09-21 18:36:20,683 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 21 treesize of output 9 [2018-09-21 18:36:20,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:20,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:36:22,072 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:36:22,073 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:36:22,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:36:22,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-21 18:36:22,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-21 18:36:22,086 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-21 18:36:22,086 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-09-21 18:36:22,086 INFO L87 Difference]: Start difference. First operand 617 states and 697 transitions. Second operand 24 states. [2018-09-21 18:36:25,286 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-21 18:36:37,138 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:36:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:36:39,869 INFO L93 Difference]: Finished difference Result 658 states and 743 transitions. [2018-09-21 18:36:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-21 18:36:39,870 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 111 [2018-09-21 18:36:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:36:39,873 INFO L225 Difference]: With dead ends: 658 [2018-09-21 18:36:39,874 INFO L226 Difference]: Without dead ends: 658 [2018-09-21 18:36:39,875 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=217, Invalid=2233, Unknown=0, NotChecked=0, Total=2450 [2018-09-21 18:36:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-09-21 18:36:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 619. [2018-09-21 18:36:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-09-21 18:36:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 700 transitions. [2018-09-21 18:36:39,891 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 700 transitions. Word has length 111 [2018-09-21 18:36:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:36:39,891 INFO L480 AbstractCegarLoop]: Abstraction has 619 states and 700 transitions. [2018-09-21 18:36:39,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-21 18:36:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 700 transitions. [2018-09-21 18:36:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-21 18:36:39,893 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:36:39,896 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, 1, 1, 1, 1, 1, 1] [2018-09-21 18:36:39,896 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:36:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2072488883, now seen corresponding path program 1 times [2018-09-21 18:36:39,897 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:36:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:36:39,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:36:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:36:40,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:36:40,430 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:36:40,703 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 11 treesize of output 8 [2018-09-21 18:36:40,707 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 8 treesize of output 7 [2018-09-21 18:36:40,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:36:40,758 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 29 treesize of output 21 [2018-09-21 18:36:40,761 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 21 treesize of output 9 [2018-09-21 18:36:40,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:40,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:36:41,356 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 11 treesize of output 8 [2018-09-21 18:36:41,363 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 8 treesize of output 7 [2018-09-21 18:36:41,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:36:41,538 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 29 treesize of output 21 [2018-09-21 18:36:41,544 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 21 treesize of output 9 [2018-09-21 18:36:41,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:36:41,781 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 11 treesize of output 8 [2018-09-21 18:36:41,787 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 8 treesize of output 7 [2018-09-21 18:36:41,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:36:41,949 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 29 treesize of output 21 [2018-09-21 18:36:41,953 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 21 treesize of output 9 [2018-09-21 18:36:41,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:41,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:36:43,705 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 11 treesize of output 8 [2018-09-21 18:36:43,710 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 8 treesize of output 7 [2018-09-21 18:36:43,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:36:43,975 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 29 treesize of output 21 [2018-09-21 18:36:43,979 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 21 treesize of output 9 [2018-09-21 18:36:43,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:36:43,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:36:44,828 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:36:44,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:36:44,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:36:44,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-09-21 18:36:44,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-21 18:36:44,843 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-21 18:36:44,843 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=866, Unknown=0, NotChecked=0, Total=930 [2018-09-21 18:36:44,844 INFO L87 Difference]: Start difference. First operand 619 states and 700 transitions. Second operand 31 states. [2018-09-21 18:37:03,557 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:37:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:37:41,811 INFO L93 Difference]: Finished difference Result 926 states and 1043 transitions. [2018-09-21 18:37:41,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-21 18:37:41,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-09-21 18:37:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:37:41,820 INFO L225 Difference]: With dead ends: 926 [2018-09-21 18:37:41,820 INFO L226 Difference]: Without dead ends: 926 [2018-09-21 18:37:41,822 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=302, Invalid=4120, Unknown=0, NotChecked=0, Total=4422 [2018-09-21 18:37:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-09-21 18:37:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 876. [2018-09-21 18:37:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-09-21 18:37:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 982 transitions. [2018-09-21 18:37:41,849 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 982 transitions. Word has length 112 [2018-09-21 18:37:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:37:41,849 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 982 transitions. [2018-09-21 18:37:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-21 18:37:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 982 transitions. [2018-09-21 18:37:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-21 18:37:41,854 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:37:41,854 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:37:41,854 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:37:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1584733161, now seen corresponding path program 1 times [2018-09-21 18:37:41,855 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:37:41,855 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:37:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:37:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:37:42,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:37:42,506 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:37:42,591 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 11 treesize of output 8 [2018-09-21 18:37:42,596 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 8 treesize of output 7 [2018-09-21 18:37:42,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:37:42,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:37:42,641 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 21 treesize of output 9 [2018-09-21 18:37:42,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:42,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:37:43,069 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 11 treesize of output 8 [2018-09-21 18:37:43,076 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 8 treesize of output 7 [2018-09-21 18:37:43,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:37:43,234 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 29 treesize of output 21 [2018-09-21 18:37:43,239 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 21 treesize of output 9 [2018-09-21 18:37:43,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:37:43,532 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 11 treesize of output 8 [2018-09-21 18:37:43,537 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 8 treesize of output 7 [2018-09-21 18:37:43,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:37:43,679 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 29 treesize of output 21 [2018-09-21 18:37:43,682 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 21 treesize of output 9 [2018-09-21 18:37:43,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:43,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:37:44,730 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 11 treesize of output 8 [2018-09-21 18:37:44,735 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 8 treesize of output 7 [2018-09-21 18:37:44,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:37:44,887 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 29 treesize of output 21 [2018-09-21 18:37:44,894 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 21 treesize of output 9 [2018-09-21 18:37:44,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:37:44,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:37:45,588 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:37:45,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:37:45,602 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:37:45,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-09-21 18:37:45,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-21 18:37:45,603 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-21 18:37:45,604 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-09-21 18:37:45,604 INFO L87 Difference]: Start difference. First operand 876 states and 982 transitions. Second operand 29 states. [2018-09-21 18:38:00,302 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:38:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:38:22,158 INFO L93 Difference]: Finished difference Result 1083 states and 1216 transitions. [2018-09-21 18:38:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-21 18:38:22,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 113 [2018-09-21 18:38:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:38:22,164 INFO L225 Difference]: With dead ends: 1083 [2018-09-21 18:38:22,164 INFO L226 Difference]: Without dead ends: 1083 [2018-09-21 18:38:22,166 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=273, Invalid=3633, Unknown=0, NotChecked=0, Total=3906 [2018-09-21 18:38:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-09-21 18:38:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 898. [2018-09-21 18:38:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2018-09-21 18:38:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1019 transitions. [2018-09-21 18:38:22,195 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1019 transitions. Word has length 113 [2018-09-21 18:38:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:38:22,195 INFO L480 AbstractCegarLoop]: Abstraction has 898 states and 1019 transitions. [2018-09-21 18:38:22,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-21 18:38:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1019 transitions. [2018-09-21 18:38:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-21 18:38:22,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:38:22,201 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:38:22,202 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:38:22,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1271954701, now seen corresponding path program 1 times [2018-09-21 18:38:22,203 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:38:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:38:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-21 18:38:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:38:22,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:38:22,939 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 11 treesize of output 8 [2018-09-21 18:38:22,944 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 8 treesize of output 7 [2018-09-21 18:38:22,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:38:22,982 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 29 treesize of output 21 [2018-09-21 18:38:22,985 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 21 treesize of output 9 [2018-09-21 18:38:22,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:22,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:38:23,090 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:38:23,091 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:38:23,107 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:38:23,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:38:23,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:38:23,108 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:38:23,108 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:38:23,108 INFO L87 Difference]: Start difference. First operand 898 states and 1019 transitions. Second operand 9 states. [2018-09-21 18:38:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:38:31,289 INFO L93 Difference]: Finished difference Result 917 states and 1040 transitions. [2018-09-21 18:38:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:38:31,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2018-09-21 18:38:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:38:31,295 INFO L225 Difference]: With dead ends: 917 [2018-09-21 18:38:31,295 INFO L226 Difference]: Without dead ends: 894 [2018-09-21 18:38:31,296 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:38:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-09-21 18:38:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 889. [2018-09-21 18:38:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-09-21 18:38:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 997 transitions. [2018-09-21 18:38:31,322 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 997 transitions. Word has length 114 [2018-09-21 18:38:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:38:31,322 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 997 transitions. [2018-09-21 18:38:31,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:38:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 997 transitions. [2018-09-21 18:38:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-21 18:38:31,327 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:38:31,328 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:38:31,328 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:38:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1483305614, now seen corresponding path program 1 times [2018-09-21 18:38:31,331 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:38:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:38:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-21 18:38:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:38:31,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:38:31,693 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 11 treesize of output 8 [2018-09-21 18:38:31,698 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 8 treesize of output 7 [2018-09-21 18:38:31,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:38:31,763 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 29 treesize of output 21 [2018-09-21 18:38:31,765 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 21 treesize of output 9 [2018-09-21 18:38:31,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:31,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:38:32,009 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:38:32,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:38:32,023 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:38:32,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-21 18:38:32,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-21 18:38:32,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-21 18:38:32,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-21 18:38:32,024 INFO L87 Difference]: Start difference. First operand 889 states and 997 transitions. Second operand 13 states. [2018-09-21 18:38:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:38:39,363 INFO L93 Difference]: Finished difference Result 894 states and 1006 transitions. [2018-09-21 18:38:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:38:39,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2018-09-21 18:38:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:38:39,376 INFO L225 Difference]: With dead ends: 894 [2018-09-21 18:38:39,376 INFO L226 Difference]: Without dead ends: 888 [2018-09-21 18:38:39,377 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:38:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-09-21 18:38:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-09-21 18:38:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-09-21 18:38:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 995 transitions. [2018-09-21 18:38:39,398 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 995 transitions. Word has length 114 [2018-09-21 18:38:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:38:39,399 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 995 transitions. [2018-09-21 18:38:39,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-21 18:38:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 995 transitions. [2018-09-21 18:38:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-21 18:38:39,404 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:38:39,404 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:38:39,405 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:38:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 728362413, now seen corresponding path program 1 times [2018-09-21 18:38:39,408 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:38:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-21 18:38:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:38:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:38:39,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:38:39,961 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:38:40,001 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 11 treesize of output 8 [2018-09-21 18:38:40,005 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 8 treesize of output 7 [2018-09-21 18:38:40,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:38:40,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 29 treesize of output 21 [2018-09-21 18:38:40,045 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 21 treesize of output 9 [2018-09-21 18:38:40,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:38:40,835 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 11 treesize of output 8 [2018-09-21 18:38:40,841 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 8 treesize of output 7 [2018-09-21 18:38:40,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:40,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:38:41,046 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 29 treesize of output 21 [2018-09-21 18:38:41,051 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 21 treesize of output 9 [2018-09-21 18:38:41,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:38:41,337 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 11 treesize of output 8 [2018-09-21 18:38:41,342 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 8 treesize of output 7 [2018-09-21 18:38:41,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:38:41,519 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 29 treesize of output 21 [2018-09-21 18:38:41,523 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 21 treesize of output 9 [2018-09-21 18:38:41,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:41,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:38:42,835 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 11 treesize of output 8 [2018-09-21 18:38:42,840 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 8 treesize of output 7 [2018-09-21 18:38:42,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:42,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:42,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:42,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:38:43,020 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 29 treesize of output 21 [2018-09-21 18:38:43,023 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 21 treesize of output 9 [2018-09-21 18:38:43,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:38:43,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:43,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:38:43,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:38:43,889 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:38:43,889 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:38:43,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:38:43,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-09-21 18:38:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-21 18:38:43,903 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-21 18:38:43,904 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-09-21 18:38:43,904 INFO L87 Difference]: Start difference. First operand 888 states and 995 transitions. Second operand 31 states. [2018-09-21 18:38:48,232 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-09-21 18:38:53,980 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:38:58,441 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:39:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:39:11,201 INFO L93 Difference]: Finished difference Result 944 states and 1065 transitions. [2018-09-21 18:39:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-21 18:39:11,203 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-09-21 18:39:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:39:11,207 INFO L225 Difference]: With dead ends: 944 [2018-09-21 18:39:11,207 INFO L226 Difference]: Without dead ends: 944 [2018-09-21 18:39:11,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=278, Invalid=3628, Unknown=0, NotChecked=0, Total=3906 [2018-09-21 18:39:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-09-21 18:39:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 902. [2018-09-21 18:39:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-09-21 18:39:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1017 transitions. [2018-09-21 18:39:11,231 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1017 transitions. Word has length 114 [2018-09-21 18:39:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:39:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1017 transitions. [2018-09-21 18:39:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-21 18:39:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1017 transitions. [2018-09-21 18:39:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-21 18:39:11,238 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:39:11,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:39:11,238 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:39:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash 905940617, now seen corresponding path program 1 times [2018-09-21 18:39:11,239 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:39:11,239 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-21 18:39:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:39:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:39:11,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:39:12,789 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-09-21 18:39:13,571 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 11 treesize of output 8 [2018-09-21 18:39:13,576 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 8 treesize of output 7 [2018-09-21 18:39:13,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:39:13,800 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 29 treesize of output 21 [2018-09-21 18:39:13,803 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 21 treesize of output 9 [2018-09-21 18:39:13,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:13,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:39:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:39:14,644 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:39:14,659 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:39:14,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-21 18:39:14,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-21 18:39:14,662 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-21 18:39:14,662 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-21 18:39:14,662 INFO L87 Difference]: Start difference. First operand 902 states and 1017 transitions. Second operand 13 states. [2018-09-21 18:39:17,438 WARN L178 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-21 18:39:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:39:30,221 INFO L93 Difference]: Finished difference Result 907 states and 1026 transitions. [2018-09-21 18:39:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:39:30,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-09-21 18:39:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:39:30,226 INFO L225 Difference]: With dead ends: 907 [2018-09-21 18:39:30,226 INFO L226 Difference]: Without dead ends: 902 [2018-09-21 18:39:30,226 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:39:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-09-21 18:39:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-09-21 18:39:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-09-21 18:39:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1016 transitions. [2018-09-21 18:39:30,245 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1016 transitions. Word has length 115 [2018-09-21 18:39:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:39:30,245 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1016 transitions. [2018-09-21 18:39:30,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-21 18:39:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1016 transitions. [2018-09-21 18:39:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-21 18:39:30,252 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:39:30,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:39:30,252 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:39:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 940405930, now seen corresponding path program 1 times [2018-09-21 18:39:30,253 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:39:30,253 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-21 18:39:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:39:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:39:30,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:39:30,806 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 11 treesize of output 8 [2018-09-21 18:39:30,811 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 8 treesize of output 7 [2018-09-21 18:39:30,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:39:30,861 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 29 treesize of output 21 [2018-09-21 18:39:30,864 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 21 treesize of output 9 [2018-09-21 18:39:30,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:30,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:39:31,664 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 11 treesize of output 8 [2018-09-21 18:39:31,670 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 8 treesize of output 7 [2018-09-21 18:39:31,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:39:31,823 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 29 treesize of output 21 [2018-09-21 18:39:31,828 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 21 treesize of output 9 [2018-09-21 18:39:31,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:31,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:39:32,070 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 11 treesize of output 8 [2018-09-21 18:39:32,076 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 8 treesize of output 7 [2018-09-21 18:39:32,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:39:32,225 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 29 treesize of output 21 [2018-09-21 18:39:32,230 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 21 treesize of output 9 [2018-09-21 18:39:32,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:32,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:39:33,105 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-21 18:39:33,144 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:39:33,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:39:33,160 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:39:33,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:39:33,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:39:33,161 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:39:33,162 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:39:33,162 INFO L87 Difference]: Start difference. First operand 902 states and 1016 transitions. Second operand 22 states. [2018-09-21 18:39:36,254 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:39:41,764 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:39:44,262 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-09-21 18:39:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:39:47,212 INFO L93 Difference]: Finished difference Result 936 states and 1053 transitions. [2018-09-21 18:39:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-21 18:39:47,214 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-09-21 18:39:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:39:47,218 INFO L225 Difference]: With dead ends: 936 [2018-09-21 18:39:47,218 INFO L226 Difference]: Without dead ends: 934 [2018-09-21 18:39:47,219 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2018-09-21 18:39:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-09-21 18:39:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 880. [2018-09-21 18:39:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-09-21 18:39:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 990 transitions. [2018-09-21 18:39:47,237 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 990 transitions. Word has length 121 [2018-09-21 18:39:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:39:47,238 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 990 transitions. [2018-09-21 18:39:47,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:39:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 990 transitions. [2018-09-21 18:39:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-21 18:39:47,243 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:39:47,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:39:47,244 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:39:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 460228773, now seen corresponding path program 1 times [2018-09-21 18:39:47,245 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:39:47,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-21 18:39:47,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:39:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:39:47,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:39:47,737 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-21 18:39:48,026 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 11 treesize of output 8 [2018-09-21 18:39:48,042 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 8 treesize of output 7 [2018-09-21 18:39:48,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:39:48,373 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 29 treesize of output 21 [2018-09-21 18:39:48,385 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 21 treesize of output 9 [2018-09-21 18:39:48,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:39:48,644 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 11 treesize of output 8 [2018-09-21 18:39:48,648 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 8 treesize of output 7 [2018-09-21 18:39:48,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:39:48,730 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 29 treesize of output 21 [2018-09-21 18:39:48,736 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 21 treesize of output 9 [2018-09-21 18:39:48,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:48,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:39:49,640 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 11 treesize of output 8 [2018-09-21 18:39:49,645 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 8 treesize of output 7 [2018-09-21 18:39:49,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:39:49,754 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 29 treesize of output 21 [2018-09-21 18:39:49,757 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 21 treesize of output 9 [2018-09-21 18:39:49,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:39:49,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:39:50,225 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:39:50,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:39:50,237 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:39:50,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-21 18:39:50,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-21 18:39:50,239 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-21 18:39:50,239 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:39:50,239 INFO L87 Difference]: Start difference. First operand 880 states and 990 transitions. Second operand 21 states. [2018-09-21 18:39:53,681 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-09-21 18:40:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:03,354 INFO L93 Difference]: Finished difference Result 892 states and 1006 transitions. [2018-09-21 18:40:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-21 18:40:03,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2018-09-21 18:40:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:03,361 INFO L225 Difference]: With dead ends: 892 [2018-09-21 18:40:03,362 INFO L226 Difference]: Without dead ends: 884 [2018-09-21 18:40:03,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2018-09-21 18:40:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-09-21 18:40:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 874. [2018-09-21 18:40:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-09-21 18:40:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 980 transitions. [2018-09-21 18:40:03,390 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 980 transitions. Word has length 121 [2018-09-21 18:40:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:03,391 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 980 transitions. [2018-09-21 18:40:03,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-21 18:40:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 980 transitions. [2018-09-21 18:40:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-21 18:40:03,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:03,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:03,401 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:03,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2018104738, now seen corresponding path program 1 times [2018-09-21 18:40:03,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:03,404 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:40:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:03,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:03,936 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 11 treesize of output 8 [2018-09-21 18:40:03,941 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 8 treesize of output 7 [2018-09-21 18:40:03,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:03,976 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 29 treesize of output 21 [2018-09-21 18:40:03,978 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 21 treesize of output 9 [2018-09-21 18:40:03,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:03,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:04,126 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:40:04,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:04,142 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:04,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:40:04,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:40:04,143 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:40:04,143 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:40:04,144 INFO L87 Difference]: Start difference. First operand 874 states and 980 transitions. Second operand 9 states. [2018-09-21 18:40:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:09,724 INFO L93 Difference]: Finished difference Result 990 states and 1098 transitions. [2018-09-21 18:40:09,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:40:09,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-09-21 18:40:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:09,731 INFO L225 Difference]: With dead ends: 990 [2018-09-21 18:40:09,731 INFO L226 Difference]: Without dead ends: 522 [2018-09-21 18:40:09,732 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:40:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-21 18:40:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2018-09-21 18:40:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-21 18:40:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 590 transitions. [2018-09-21 18:40:09,748 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 590 transitions. Word has length 151 [2018-09-21 18:40:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:09,748 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 590 transitions. [2018-09-21 18:40:09,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:40:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 590 transitions. [2018-09-21 18:40:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-21 18:40:09,754 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:09,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,754 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1385993898, now seen corresponding path program 1 times [2018-09-21 18:40:09,755 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:10,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:10,102 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 11 treesize of output 8 [2018-09-21 18:40:10,106 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 8 treesize of output 7 [2018-09-21 18:40:10,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:10,146 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 29 treesize of output 21 [2018-09-21 18:40:10,148 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 21 treesize of output 9 [2018-09-21 18:40:10,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:10,564 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 11 treesize of output 8 [2018-09-21 18:40:10,572 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 8 treesize of output 7 [2018-09-21 18:40:10,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:40:10,718 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 29 treesize of output 21 [2018-09-21 18:40:10,723 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 21 treesize of output 9 [2018-09-21 18:40:10,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:40:10,961 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 11 treesize of output 8 [2018-09-21 18:40:10,967 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 8 treesize of output 7 [2018-09-21 18:40:10,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:10,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-21 18:40:11,114 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 29 treesize of output 21 [2018-09-21 18:40:11,137 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 21 treesize of output 9 [2018-09-21 18:40:11,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:11,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:11,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:11,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-21 18:40:11,979 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:40:11,980 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:11,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:11,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:40:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:40:11,993 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:40:11,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:40:11,993 INFO L87 Difference]: Start difference. First operand 520 states and 590 transitions. Second operand 22 states. [2018-09-21 18:40:14,857 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:40:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:23,983 INFO L93 Difference]: Finished difference Result 548 states and 612 transitions. [2018-09-21 18:40:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-21 18:40:23,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 167 [2018-09-21 18:40:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:23,989 INFO L225 Difference]: With dead ends: 548 [2018-09-21 18:40:23,989 INFO L226 Difference]: Without dead ends: 548 [2018-09-21 18:40:23,990 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2018-09-21 18:40:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-09-21 18:40:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 514. [2018-09-21 18:40:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-09-21 18:40:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 576 transitions. [2018-09-21 18:40:24,001 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 576 transitions. Word has length 167 [2018-09-21 18:40:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:24,001 INFO L480 AbstractCegarLoop]: Abstraction has 514 states and 576 transitions. [2018-09-21 18:40:24,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:40:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 576 transitions. [2018-09-21 18:40:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-21 18:40:24,006 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:24,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:24,007 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -905375728, now seen corresponding path program 1 times [2018-09-21 18:40:24,008 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:24,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:24,297 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:40:24,297 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:24,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:24,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-21 18:40:24,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-21 18:40:24,311 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-21 18:40:24,311 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 18:40:24,311 INFO L87 Difference]: Start difference. First operand 514 states and 576 transitions. Second operand 3 states. [2018-09-21 18:40:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:24,357 INFO L93 Difference]: Finished difference Result 644 states and 717 transitions. [2018-09-21 18:40:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-21 18:40:24,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-09-21 18:40:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:24,361 INFO L225 Difference]: With dead ends: 644 [2018-09-21 18:40:24,361 INFO L226 Difference]: Without dead ends: 644 [2018-09-21 18:40:24,362 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 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:40:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-09-21 18:40:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 541. [2018-09-21 18:40:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-09-21 18:40:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 602 transitions. [2018-09-21 18:40:24,374 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 602 transitions. Word has length 155 [2018-09-21 18:40:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:24,376 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 602 transitions. [2018-09-21 18:40:24,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-21 18:40:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 602 transitions. [2018-09-21 18:40:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-21 18:40:24,381 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:24,381 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:24,381 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash -686521010, now seen corresponding path program 1 times [2018-09-21 18:40:24,382 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:40:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:24,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:24,768 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 11 treesize of output 8 [2018-09-21 18:40:24,772 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 8 treesize of output 7 [2018-09-21 18:40:24,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:24,806 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 29 treesize of output 21 [2018-09-21 18:40:24,809 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 21 treesize of output 9 [2018-09-21 18:40:24,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:24,895 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 13 treesize of output 10 [2018-09-21 18:40:24,912 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 10 treesize of output 9 [2018-09-21 18:40:24,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:24,940 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:40:24,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:40:24,987 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 31 treesize of output 23 [2018-09-21 18:40:24,992 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 23 treesize of output 15 [2018-09-21 18:40:24,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,010 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:40:25,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:40:25,756 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 11 treesize of output 8 [2018-09-21 18:40:25,760 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 8 treesize of output 7 [2018-09-21 18:40:25,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:25,873 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 29 treesize of output 21 [2018-09-21 18:40:25,875 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 21 treesize of output 9 [2018-09-21 18:40:25,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:25,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:40:26,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:26,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:26,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-21 18:40:26,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-21 18:40:26,339 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-21 18:40:26,339 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-21 18:40:26,339 INFO L87 Difference]: Start difference. First operand 541 states and 602 transitions. Second operand 24 states. [2018-09-21 18:40:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:44,508 INFO L93 Difference]: Finished difference Result 550 states and 613 transitions. [2018-09-21 18:40:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-21 18:40:44,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 155 [2018-09-21 18:40:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:44,513 INFO L225 Difference]: With dead ends: 550 [2018-09-21 18:40:44,513 INFO L226 Difference]: Without dead ends: 534 [2018-09-21 18:40:44,514 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=183, Invalid=2073, Unknown=0, NotChecked=0, Total=2256 [2018-09-21 18:40:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-09-21 18:40:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-09-21 18:40:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-09-21 18:40:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 592 transitions. [2018-09-21 18:40:44,522 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 592 transitions. Word has length 155 [2018-09-21 18:40:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:44,524 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 592 transitions. [2018-09-21 18:40:44,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-21 18:40:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 592 transitions. [2018-09-21 18:40:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-21 18:40:44,530 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:44,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:44,530 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1585810186, now seen corresponding path program 1 times [2018-09-21 18:40:44,531 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:44,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:44,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:44,914 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 11 treesize of output 8 [2018-09-21 18:40:44,918 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 8 treesize of output 7 [2018-09-21 18:40:44,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:44,963 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 29 treesize of output 21 [2018-09-21 18:40:44,966 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 21 treesize of output 9 [2018-09-21 18:40:44,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:44,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:45,590 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:40:45,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:45,603 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:45,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:40:45,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:40:45,604 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:40:45,604 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:40:45,605 INFO L87 Difference]: Start difference. First operand 534 states and 592 transitions. Second operand 18 states. [2018-09-21 18:40:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:50,315 INFO L93 Difference]: Finished difference Result 562 states and 618 transitions. [2018-09-21 18:40:50,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-21 18:40:50,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2018-09-21 18:40:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:50,318 INFO L225 Difference]: With dead ends: 562 [2018-09-21 18:40:50,318 INFO L226 Difference]: Without dead ends: 509 [2018-09-21 18:40:50,318 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2018-09-21 18:40:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-09-21 18:40:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 493. [2018-09-21 18:40:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-09-21 18:40:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 540 transitions. [2018-09-21 18:40:50,328 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 540 transitions. Word has length 157 [2018-09-21 18:40:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:50,328 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 540 transitions. [2018-09-21 18:40:50,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:40:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 540 transitions. [2018-09-21 18:40:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-21 18:40:50,332 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:50,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:50,332 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 554343925, now seen corresponding path program 1 times [2018-09-21 18:40:50,333 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:50,333 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:50,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:50,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:50,687 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 11 treesize of output 8 [2018-09-21 18:40:50,691 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 8 treesize of output 7 [2018-09-21 18:40:50,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:50,729 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 29 treesize of output 21 [2018-09-21 18:40:50,733 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 21 treesize of output 9 [2018-09-21 18:40:50,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:50,791 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 13 treesize of output 10 [2018-09-21 18:40:50,795 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 10 treesize of output 9 [2018-09-21 18:40:50,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,813 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:40:50,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:40:50,865 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 31 treesize of output 23 [2018-09-21 18:40:50,890 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 23 treesize of output 15 [2018-09-21 18:40:50,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:50,915 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:40:50,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:40:52,346 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 11 treesize of output 8 [2018-09-21 18:40:52,350 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 8 treesize of output 7 [2018-09-21 18:40:52,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:52,496 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 29 treesize of output 21 [2018-09-21 18:40:52,499 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 21 treesize of output 9 [2018-09-21 18:40:52,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:52,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:53,123 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:40:53,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:53,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:53,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-09-21 18:40:53,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-21 18:40:53,136 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-21 18:40:53,136 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-21 18:40:53,137 INFO L87 Difference]: Start difference. First operand 493 states and 540 transitions. Second operand 25 states. [2018-09-21 18:41:19,873 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:41:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:41:24,315 INFO L93 Difference]: Finished difference Result 496 states and 543 transitions. [2018-09-21 18:41:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-21 18:41:24,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 157 [2018-09-21 18:41:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:41:24,319 INFO L225 Difference]: With dead ends: 496 [2018-09-21 18:41:24,319 INFO L226 Difference]: Without dead ends: 445 [2018-09-21 18:41:24,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=191, Invalid=2258, Unknown=1, NotChecked=0, Total=2450 [2018-09-21 18:41:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-09-21 18:41:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-09-21 18:41:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-21 18:41:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 481 transitions. [2018-09-21 18:41:24,327 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 481 transitions. Word has length 157 [2018-09-21 18:41:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:41:24,328 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 481 transitions. [2018-09-21 18:41:24,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-21 18:41:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 481 transitions. [2018-09-21 18:41:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-21 18:41:24,329 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:41:24,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,330 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:41:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1608948818, now seen corresponding path program 1 times [2018-09-21 18:41:24,330 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:41:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-09-21 18:41:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:41:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:41:25,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:41:25,595 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 11 treesize of output 8 [2018-09-21 18:41:25,601 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 8 treesize of output 7 [2018-09-21 18:41:25,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:41:25,636 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 29 treesize of output 21 [2018-09-21 18:41:25,639 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 21 treesize of output 9 [2018-09-21 18:41:25,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:41:25,870 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:41:25,870 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:41:25,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:41:25,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:41:25,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:41:25,901 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:41:25,902 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:41:25,902 INFO L87 Difference]: Start difference. First operand 445 states and 481 transitions. Second operand 9 states. [2018-09-21 18:41:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:41:29,156 INFO L93 Difference]: Finished difference Result 426 states and 462 transitions. [2018-09-21 18:41:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:41:29,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 211 [2018-09-21 18:41:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:41:29,159 INFO L225 Difference]: With dead ends: 426 [2018-09-21 18:41:29,159 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:41:29,160 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:41:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:41:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:41:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:41:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:41:29,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-09-21 18:41:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:41:29,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:41:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:41:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:41:29,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:41:29,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:41:29 BoogieIcfgContainer [2018-09-21 18:41:29,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:41:29,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:41:29,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:41:29,168 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:41:29,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:31:38" (3/4) ... [2018-09-21 18:41:29,172 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_float [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure copysign_float [2018-09-21 18:41:29,182 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_powf [2018-09-21 18:41:29,183 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure scalbn_float [2018-09-21 18:41:29,183 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:41:29,183 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fmod_float [2018-09-21 18:41:29,183 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinteger_float [2018-09-21 18:41:29,183 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-09-21 18:41:29,225 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 136 nodes and edges [2018-09-21 18:41:29,229 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2018-09-21 18:41:29,234 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-21 18:41:29,239 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-09-21 18:41:29,464 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:41:29,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:41:29,465 INFO L168 Benchmark]: Toolchain (without parser) took 621482.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 953.2 MB in the beginning and 892.0 MB in the end (delta: 61.2 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:41:29,467 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:41:29,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.26 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 921.0 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:41:29,468 INFO L168 Benchmark]: Boogie Preprocessor took 269.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 921.0 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:41:29,468 INFO L168 Benchmark]: RCFGBuilder took 29087.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.6 MB in the end (delta: 141.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:41:29,472 INFO L168 Benchmark]: TraceAbstraction took 591019.98 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -17.8 MB). Free memory was 971.6 MB in the beginning and 925.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:41:29,473 INFO L168 Benchmark]: Witness Printer took 296.76 ms. Allocated memory is still 1.1 GB. Free memory was 925.2 MB in the beginning and 892.0 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:41:29,479 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 802.26 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 921.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 269.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 921.0 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 29087.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.6 MB in the end (delta: 141.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 591019.98 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -17.8 MB). Free memory was 971.6 MB in the beginning and 925.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Witness Printer took 296.76 ms. Allocated memory is still 1.1 GB. Free memory was 925.2 MB in the beginning and 892.0 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 669]: 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 12 procedures, 618 locations, 1 error locations. SAFE Result, 590.9s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 501.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16226 SDtfs, 14755 SDslu, 230975 SDs, 0 SdLazy, 29912 SolverSat, 472 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 356.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3709 GetRequests, 2762 SyntacticMatches, 0 SemanticMatches, 947 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6787 ImplicationChecksByTransitivity, 187.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=17, 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.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 1009 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 79.8s InterpolantComputationTime, 3227 NumberOfCodeBlocks, 3227 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3200 ConstructedInterpolants, 474 QuantifiedInterpolants, 3047023 SizeOfPredicates, 483 NumberOfNonLiveVariables, 9192 ConjunctsInSsa, 607 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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...