/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0864a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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_0864a_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 7bc30dfff12d2c2c64f2eac83dc39be7c14213eb ......................................................................................................................................................... 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_0864a_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 7bc30dfff12d2c2c64f2eac83dc39be7c14213eb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:21:08,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:21:08,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:21:08,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:21:08,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:21:08,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:21:08,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:21:08,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:21:08,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:21:08,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:21:08,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:21:08,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:21:08,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:21:08,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:21:08,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:21:08,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:21:08,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:21:08,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:21:08,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:21:08,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:21:08,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:21:08,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:21:08,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:21:08,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:21:08,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:21:08,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:21:08,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:21:08,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:21:08,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:21:08,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:21:08,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:21:08,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:21:08,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:21:08,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:21:08,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:21:08,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:21:08,998 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:21:09,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:21:09,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:21:09,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:21:09,016 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:21:09,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:21:09,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:21:09,018 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:21:09,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:21:09,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:21:09,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:21:09,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:21:09,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:21:09,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:21:09,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:21:09,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:21:09,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:21:09,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:21:09,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:21:09,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:21:09,023 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:21:09,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:21:09,023 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:21:09,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:21:09,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:21:09,024 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 -> 7bc30dfff12d2c2c64f2eac83dc39be7c14213eb [2018-09-20 15:21:09,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:21:09,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:21:09,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:21:09,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:21:09,105 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:21:09,107 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0864a_true-unreach-call.c [2018-09-20 15:21:09,460 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6663820f3/88796c8540cd489a85f06a26e51946f8/FLAGbdaa99bb8 [2018-09-20 15:21:09,661 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:21:09,662 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0864a_true-unreach-call.c [2018-09-20 15:21:09,681 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6663820f3/88796c8540cd489a85f06a26e51946f8/FLAGbdaa99bb8 [2018-09-20 15:21:09,697 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6663820f3/88796c8540cd489a85f06a26e51946f8 [2018-09-20 15:21:09,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:21:09,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:21:09,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:21:09,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:21:09,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:21:09,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:21:09" (1/1) ... [2018-09-20 15:21:09,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0e192e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:09, skipping insertion in model container [2018-09-20 15:21:09,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:21:09" (1/1) ... [2018-09-20 15:21:09,729 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:21:10,104 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-20 15:21:10,113 INFO L168 Benchmark]: Toolchain (without parser) took 412.28 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:21:10,116 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:21:10,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:21:10,121 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * 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-40ef509 [2018-09-20 15:21:12,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:21:12,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:21:12,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:21:12,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:21:12,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:21:12,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:21:12,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:21:12,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:21:12,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:21:12,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:21:12,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:21:12,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:21:12,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:21:12,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:21:12,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:21:12,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:21:12,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:21:12,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:21:12,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:21:12,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:21:12,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:21:12,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:21:12,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:21:12,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:21:12,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:21:12,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:21:12,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:21:12,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:21:12,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:21:12,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:21:12,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:21:12,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:21:12,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:21:12,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:21:12,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:21:12,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:21:12,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:21:12,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:21:12,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:21:12,520 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:21:12,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:21:12,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:21:12,521 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:21:12,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:21:12,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:21:12,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:21:12,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:21:12,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:21:12,524 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:21:12,524 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:21:12,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:21:12,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:21:12,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:21:12,526 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:21:12,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:21:12,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:21:12,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:21:12,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:21:12,527 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:21:12,527 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:21:12,528 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:21:12,529 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:21:12,529 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 -> 7bc30dfff12d2c2c64f2eac83dc39be7c14213eb [2018-09-20 15:21:12,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:21:12,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:21:12,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:21:12,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:21:12,630 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:21:12,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0864a_true-unreach-call.c [2018-09-20 15:21:13,025 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79ebd963/96ce7b85a65c45d7afd747b8a5ea7b60/FLAG1efe8aed1 [2018-09-20 15:21:13,301 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:21:13,302 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0864a_true-unreach-call.c [2018-09-20 15:21:13,329 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79ebd963/96ce7b85a65c45d7afd747b8a5ea7b60/FLAG1efe8aed1 [2018-09-20 15:21:13,353 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79ebd963/96ce7b85a65c45d7afd747b8a5ea7b60 [2018-09-20 15:21:13,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:21:13,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:21:13,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:21:13,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:21:13,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:21:13,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:21:13" (1/1) ... [2018-09-20 15:21:13,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2576490b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:13, skipping insertion in model container [2018-09-20 15:21:13,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:21:13" (1/1) ... [2018-09-20 15:21:13,387 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:21:13,876 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:21:13,904 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:21:14,065 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:21:14,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14 WrapperNode [2018-09-20 15:21:14,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:21:14,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:21:14,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:21:14,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:21:14,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (1/1) ... [2018-09-20 15:21:14,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:21:14,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:21:14,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:21:14,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:21:14,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (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-20 15:21:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:21:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:21:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_float [2018-09-20 15:21:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:21:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2018-09-20 15:21:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2018-09-20 15:21:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-20 15:21:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_powf [2018-09-20 15:21:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:21:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-20 15:21:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-09-20 15:21:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isinteger_float [2018-09-20 15:21:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:21:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:21:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:21:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_float [2018-09-20 15:21:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:21:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:21:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:21:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:21:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:21:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:21:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:21:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2018-09-20 15:21:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2018-09-20 15:21:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-20 15:21:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_powf [2018-09-20 15:21:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-20 15:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-09-20 15:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure isinteger_float [2018-09-20 15:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:21:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:21:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:21:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:21:15,112 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,129 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,342 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,358 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,387 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,396 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,478 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,498 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,519 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:15,548 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:19,561 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:19,568 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:19,759 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:19,768 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:22,026 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:22,032 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:24,285 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:24,308 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:25,999 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:26,009 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:28,124 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:28,140 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:30,008 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:30,019 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:32,086 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:32,093 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:35,745 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:35,781 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:38,212 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:38,221 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:38,404 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:38,416 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:40,488 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:40,496 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:40,796 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:40,827 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:41,251 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:41,286 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:41,852 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:41,858 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:42,154 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:42,161 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:42,179 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:42,194 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:44,878 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:44,922 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:21:45,352 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:21:45,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:21:45 BoogieIcfgContainer [2018-09-20 15:21:45,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:21:45,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:21:45,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:21:45,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:21:45,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:21:13" (1/3) ... [2018-09-20 15:21:45,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ce912c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:21:45, skipping insertion in model container [2018-09-20 15:21:45,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:21:14" (2/3) ... [2018-09-20 15:21:45,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ce912c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:21:45, skipping insertion in model container [2018-09-20 15:21:45,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:21:45" (3/3) ... [2018-09-20 15:21:45,365 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0864a_true-unreach-call.c [2018-09-20 15:21:45,375 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:21:45,386 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:21:45,441 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:21:45,442 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:21:45,442 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:21:45,442 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:21:45,442 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:21:45,443 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:21:45,443 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:21:45,443 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:21:45,443 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:21:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2018-09-20 15:21:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:21:45,506 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:21:45,507 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-20 15:21:45,510 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:21:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash -283590530, now seen corresponding path program 1 times [2018-09-20 15:21:45,519 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:21:45,520 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-20 15:21:45,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:21:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:21:45,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:21:45,732 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-20 15:21:45,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:21:45,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:21:45,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:21:45,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:21:45,775 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:21:45,776 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:21:45,778 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 2 states. [2018-09-20 15:21:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:21:45,876 INFO L93 Difference]: Finished difference Result 1227 states and 1594 transitions. [2018-09-20 15:21:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:21:45,878 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:21:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:21:45,899 INFO L225 Difference]: With dead ends: 1227 [2018-09-20 15:21:45,899 INFO L226 Difference]: Without dead ends: 613 [2018-09-20 15:21:45,909 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-20 15:21:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-09-20 15:21:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2018-09-20 15:21:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-09-20 15:21:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 702 transitions. [2018-09-20 15:21:46,006 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 702 transitions. Word has length 27 [2018-09-20 15:21:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:21:46,006 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 702 transitions. [2018-09-20 15:21:46,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:21:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 702 transitions. [2018-09-20 15:21:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-20 15:21:46,010 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:21:46,011 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-20 15:21:46,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:21:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1351175983, now seen corresponding path program 1 times [2018-09-20 15:21:46,012 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:21:46,013 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-20 15:21:46,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:21:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:21:46,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:21:46,285 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-20 15:21:46,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:21:46,297 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:21:46,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:21:46,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:21:46,299 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:21:46,299 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:21:46,300 INFO L87 Difference]: Start difference. First operand 613 states and 702 transitions. Second operand 4 states. [2018-09-20 15:21:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:21:46,456 INFO L93 Difference]: Finished difference Result 1148 states and 1309 transitions. [2018-09-20 15:21:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:21:46,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-09-20 15:21:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:21:46,461 INFO L225 Difference]: With dead ends: 1148 [2018-09-20 15:21:46,461 INFO L226 Difference]: Without dead ends: 613 [2018-09-20 15:21:46,464 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-20 15:21:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-09-20 15:21:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2018-09-20 15:21:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-09-20 15:21:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 700 transitions. [2018-09-20 15:21:46,508 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 700 transitions. Word has length 54 [2018-09-20 15:21:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:21:46,509 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 700 transitions. [2018-09-20 15:21:46,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:21:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 700 transitions. [2018-09-20 15:21:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-20 15:21:46,519 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:21:46,519 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-20 15:21:46,520 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:21:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -160741164, now seen corresponding path program 1 times [2018-09-20 15:21:46,521 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:21:46,521 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-20 15:21:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:21:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:21:47,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:21:47,155 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-20 15:21:47,169 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-20 15:21:47,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,206 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-20 15:21:47,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:21:47,257 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-20 15:21:47,263 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-20 15:21:47,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,356 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-20 15:21:47,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:21:47,475 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-20 15:21:47,493 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-20 15:21:47,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,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-20 15:21:47,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:21:47,690 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-20 15:21:47,694 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-20 15:21:47,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:47,712 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-20 15:21:47,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:21:48,241 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-20 15:21:48,486 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-20 15:21:48,490 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-20 15:21:48,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:48,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:48,507 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-20 15:21:48,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:21:48,602 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-20 15:21:48,606 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-20 15:21:48,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:21:48,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:21:48,612 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-20 15:21:48,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:21:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:21:49,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:21:49,082 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:21:49,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-20 15:21:49,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-20 15:21:49,083 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-20 15:21:49,084 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:21:49,084 INFO L87 Difference]: Start difference. First operand 613 states and 700 transitions. Second operand 18 states. [2018-09-20 15:21:53,646 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-20 15:22:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:22:07,249 INFO L93 Difference]: Finished difference Result 654 states and 744 transitions. [2018-09-20 15:22:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-20 15:22:07,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2018-09-20 15:22:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:22:07,257 INFO L225 Difference]: With dead ends: 654 [2018-09-20 15:22:07,257 INFO L226 Difference]: Without dead ends: 635 [2018-09-20 15:22:07,259 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2018-09-20 15:22:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-09-20 15:22:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 624. [2018-09-20 15:22:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-09-20 15:22:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 713 transitions. [2018-09-20 15:22:07,289 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 713 transitions. Word has length 104 [2018-09-20 15:22:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:22:07,290 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 713 transitions. [2018-09-20 15:22:07,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-20 15:22:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 713 transitions. [2018-09-20 15:22:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-20 15:22:07,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:22:07,293 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:22:07,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:22:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1938994280, now seen corresponding path program 1 times [2018-09-20 15:22:07,294 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:22:07,294 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-20 15:22:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:22:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:22:07,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:22:07,832 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 15:22:08,377 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-20 15:22:08,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:22:08,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:22:08,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:22:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:22:08,399 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:22:08,399 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:22:08,399 INFO L87 Difference]: Start difference. First operand 624 states and 713 transitions. Second operand 9 states. [2018-09-20 15:22:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:22:10,660 INFO L93 Difference]: Finished difference Result 1164 states and 1324 transitions. [2018-09-20 15:22:10,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:22:10,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-09-20 15:22:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:22:10,666 INFO L225 Difference]: With dead ends: 1164 [2018-09-20 15:22:10,667 INFO L226 Difference]: Without dead ends: 626 [2018-09-20 15:22:10,669 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:22:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-09-20 15:22:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2018-09-20 15:22:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-09-20 15:22:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 712 transitions. [2018-09-20 15:22:10,699 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 712 transitions. Word has length 105 [2018-09-20 15:22:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:22:10,700 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 712 transitions. [2018-09-20 15:22:10,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:22:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 712 transitions. [2018-09-20 15:22:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-20 15:22:10,703 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:22:10,703 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-20 15:22:10,704 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:22:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 544179664, now seen corresponding path program 1 times [2018-09-20 15:22:10,705 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:22:10,705 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-20 15:22:10,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:22:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:22:10,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:22:11,015 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-20 15:22:11,024 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-20 15:22:11,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,068 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-20 15:22:11,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:22:11,110 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-20 15:22:11,117 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-20 15:22:11,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,175 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-20 15:22:11,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:22:11,320 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-20 15:22:11,337 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-20 15:22:11,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,365 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-20 15:22:11,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:22:11,416 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-20 15:22:11,421 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-20 15:22:11,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:11,438 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-20 15:22:11,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:22:12,363 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-20 15:22:12,367 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-20 15:22:12,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:12,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:12,383 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-20 15:22:12,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:22:12,467 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-20 15:22:12,477 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-20 15:22:12,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:12,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:12,488 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-20 15:22:12,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:22:13,448 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-20 15:22:13,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:22:13,461 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:22:13,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-20 15:22:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:22:13,462 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:22:13,462 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:22:13,462 INFO L87 Difference]: Start difference. First operand 624 states and 712 transitions. Second operand 21 states. [2018-09-20 15:22:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:22:29,509 INFO L93 Difference]: Finished difference Result 1153 states and 1308 transitions. [2018-09-20 15:22:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-20 15:22:29,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-09-20 15:22:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:22:29,516 INFO L225 Difference]: With dead ends: 1153 [2018-09-20 15:22:29,516 INFO L226 Difference]: Without dead ends: 661 [2018-09-20 15:22:29,519 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-09-20 15:22:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-20 15:22:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 635. [2018-09-20 15:22:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-09-20 15:22:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 725 transitions. [2018-09-20 15:22:29,550 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 725 transitions. Word has length 106 [2018-09-20 15:22:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:22:29,551 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 725 transitions. [2018-09-20 15:22:29,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:22:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 725 transitions. [2018-09-20 15:22:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:22:29,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:22:29,553 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] [2018-09-20 15:22:29,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:22:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash -459383831, now seen corresponding path program 1 times [2018-09-20 15:22:29,554 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:22:29,554 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) [2018-09-20 15:22:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:22:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:22:29,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:22:29,990 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-20 15:22:30,002 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-20 15:22:30,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,069 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-20 15:22:30,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:22:30,108 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-20 15:22:30,113 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-20 15:22:30,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,145 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-20 15:22:30,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:22:30,214 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-20 15:22:30,219 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-20 15:22:30,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,243 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-20 15:22:30,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:22:30,289 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-20 15:22:30,293 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-20 15:22:30,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:30,309 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-20 15:22:30,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:22:32,058 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-20 15:22:32,063 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-20 15:22:32,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:32,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:32,085 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-20 15:22:32,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:22:32,197 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-20 15:22:32,205 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-20 15:22:32,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:32,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:32,213 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-20 15:22:32,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:22:33,026 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-20 15:22:33,027 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:22:33,040 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:22:33,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-09-20 15:22:33,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-20 15:22:33,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-20 15:22:33,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-09-20 15:22:33,042 INFO L87 Difference]: Start difference. First operand 635 states and 725 transitions. Second operand 25 states. [2018-09-20 15:22:45,962 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-09-20 15:22:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:22:54,408 INFO L93 Difference]: Finished difference Result 1287 states and 1468 transitions. [2018-09-20 15:22:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-20 15:22:54,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-09-20 15:22:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:22:54,421 INFO L225 Difference]: With dead ends: 1287 [2018-09-20 15:22:54,421 INFO L226 Difference]: Without dead ends: 719 [2018-09-20 15:22:54,425 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=226, Invalid=2530, Unknown=0, NotChecked=0, Total=2756 [2018-09-20 15:22:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-09-20 15:22:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 658. [2018-09-20 15:22:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-09-20 15:22:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 756 transitions. [2018-09-20 15:22:54,465 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 756 transitions. Word has length 116 [2018-09-20 15:22:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:22:54,466 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 756 transitions. [2018-09-20 15:22:54,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-20 15:22:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 756 transitions. [2018-09-20 15:22:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:22:54,469 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:22:54,470 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] [2018-09-20 15:22:54,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:22:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1601886297, now seen corresponding path program 1 times [2018-09-20 15:22:54,471 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:22:54,471 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-20 15:22:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:22:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:22:54,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:22:54,738 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-20 15:22:54,741 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-20 15:22:54,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:54,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:54,757 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-20 15:22:54,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:22:54,777 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-20 15:22:54,781 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-20 15:22:54,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:22:54,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:22:54,790 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-20 15:22:54,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:22:55,021 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-20 15:22:55,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:22:55,034 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:22:55,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:22:55,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:22:55,035 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:22:55,035 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:22:55,036 INFO L87 Difference]: Start difference. First operand 658 states and 756 transitions. Second operand 9 states. [2018-09-20 15:23:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:23:01,755 INFO L93 Difference]: Finished difference Result 1315 states and 1509 transitions. [2018-09-20 15:23:01,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:23:01,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-09-20 15:23:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:23:01,765 INFO L225 Difference]: With dead ends: 1315 [2018-09-20 15:23:01,765 INFO L226 Difference]: Without dead ends: 671 [2018-09-20 15:23:01,768 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:23:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-09-20 15:23:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 658. [2018-09-20 15:23:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-09-20 15:23:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 753 transitions. [2018-09-20 15:23:01,801 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 753 transitions. Word has length 116 [2018-09-20 15:23:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:23:01,801 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 753 transitions. [2018-09-20 15:23:01,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:23:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 753 transitions. [2018-09-20 15:23:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:23:01,803 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:23:01,804 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] [2018-09-20 15:23:01,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:23:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1517221909, now seen corresponding path program 1 times [2018-09-20 15:23:01,805 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:23:01,805 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) [2018-09-20 15:23:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:23:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:23:02,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:23:02,062 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-20 15:23:02,069 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-20 15:23:02,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:02,090 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-20 15:23:02,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:23:02,106 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-20 15:23:02,109 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-20 15:23:02,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:02,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:02,116 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-20 15:23:02,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:23:02,677 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-20 15:23:02,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:23:02,697 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:23:02,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:23:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:23:02,698 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:23:02,699 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:23:02,699 INFO L87 Difference]: Start difference. First operand 658 states and 753 transitions. Second operand 10 states. [2018-09-20 15:23:05,303 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-09-20 15:23:05,546 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-09-20 15:23:06,138 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-09-20 15:23:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:23:08,231 INFO L93 Difference]: Finished difference Result 1305 states and 1495 transitions. [2018-09-20 15:23:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-20 15:23:08,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-09-20 15:23:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:23:08,245 INFO L225 Difference]: With dead ends: 1305 [2018-09-20 15:23:08,246 INFO L226 Difference]: Without dead ends: 653 [2018-09-20 15:23:08,249 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-09-20 15:23:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-09-20 15:23:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2018-09-20 15:23:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-20 15:23:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 745 transitions. [2018-09-20 15:23:08,288 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 745 transitions. Word has length 116 [2018-09-20 15:23:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:23:08,289 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 745 transitions. [2018-09-20 15:23:08,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:23:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 745 transitions. [2018-09-20 15:23:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-20 15:23:08,292 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:23:08,292 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] [2018-09-20 15:23:08,292 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:23:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -740617308, now seen corresponding path program 1 times [2018-09-20 15:23:08,293 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:23:08,293 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-20 15:23:08,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:23:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:23:08,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:23:08,552 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-20 15:23:08,557 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-20 15:23:08,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:08,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:08,575 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-20 15:23:08,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:23:08,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-20 15:23:08,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:23:08,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:08,602 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-20 15:23:08,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:23:10,448 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-20 15:23:10,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:23:10,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:23:10,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-20 15:23:10,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-20 15:23:10,461 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-20 15:23:10,461 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:23:10,462 INFO L87 Difference]: Start difference. First operand 653 states and 745 transitions. Second operand 18 states. [2018-09-20 15:23:16,032 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:23:18,661 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:23:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:23:24,035 INFO L93 Difference]: Finished difference Result 1216 states and 1381 transitions. [2018-09-20 15:23:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:23:24,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2018-09-20 15:23:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:23:24,043 INFO L225 Difference]: With dead ends: 1216 [2018-09-20 15:23:24,043 INFO L226 Difference]: Without dead ends: 653 [2018-09-20 15:23:24,046 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:23:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-09-20 15:23:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2018-09-20 15:23:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-20 15:23:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 744 transitions. [2018-09-20 15:23:24,093 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 744 transitions. Word has length 117 [2018-09-20 15:23:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:23:24,094 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 744 transitions. [2018-09-20 15:23:24,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-20 15:23:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 744 transitions. [2018-09-20 15:23:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-20 15:23:24,097 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:23:24,098 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:23:24,098 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:23:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -452408754, now seen corresponding path program 1 times [2018-09-20 15:23:24,099 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:23:24,099 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-20 15:23:24,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:23:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:23:24,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:23:24,398 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-20 15:23:24,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-20 15:23:24,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:24,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:24,426 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-20 15:23:24,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:23:24,442 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-20 15:23:24,459 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-20 15:23:24,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:24,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:24,467 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-20 15:23:24,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:23:26,481 WARN L178 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:23:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:23:26,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:23:27,030 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 15:23:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:23:28,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-20 15:23:28,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-09-20 15:23:28,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:23:28,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:23:28,669 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:23:28,669 INFO L87 Difference]: Start difference. First operand 653 states and 744 transitions. Second operand 19 states. [2018-09-20 15:23:37,964 WARN L178 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:23:40,566 WARN L178 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 27 [2018-09-20 15:23:42,636 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:23:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:23:44,515 INFO L93 Difference]: Finished difference Result 1309 states and 1488 transitions. [2018-09-20 15:23:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-20 15:23:44,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 120 [2018-09-20 15:23:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:23:44,523 INFO L225 Difference]: With dead ends: 1309 [2018-09-20 15:23:44,523 INFO L226 Difference]: Without dead ends: 719 [2018-09-20 15:23:44,526 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2018-09-20 15:23:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-09-20 15:23:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 653. [2018-09-20 15:23:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-20 15:23:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 743 transitions. [2018-09-20 15:23:44,574 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 743 transitions. Word has length 120 [2018-09-20 15:23:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:23:44,575 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 743 transitions. [2018-09-20 15:23:44,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:23:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 743 transitions. [2018-09-20 15:23:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:23:44,578 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:23:44,579 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] [2018-09-20 15:23:44,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:23:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash 309786184, now seen corresponding path program 1 times [2018-09-20 15:23:44,581 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:23:44,581 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-20 15:23:44,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:23:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:23:44,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:23:45,010 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-20 15:23:45,017 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-20 15:23:45,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,044 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-20 15:23:45,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:23:45,084 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-20 15:23:45,096 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-20 15:23:45,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,129 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-20 15:23:45,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:23:45,199 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-20 15:23:45,204 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-20 15:23:45,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,229 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-20 15:23:45,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:23:45,272 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-20 15:23:45,276 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-20 15:23:45,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:45,312 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-20 15:23:45,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:23:47,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:23:47,041 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-20 15:23:47,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:47,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:47,057 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-20 15:23:47,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:23:47,181 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-20 15:23:47,185 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-20 15:23:47,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:23:47,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:23:47,195 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-20 15:23:47,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:23:47,756 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-20 15:23:47,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:23:47,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:23:47,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:23:47,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:23:47,771 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:23:47,772 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:23:47,772 INFO L87 Difference]: Start difference. First operand 653 states and 743 transitions. Second operand 22 states. [2018-09-20 15:23:59,447 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-20 15:24:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:24:13,885 INFO L93 Difference]: Finished difference Result 711 states and 806 transitions. [2018-09-20 15:24:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-20 15:24:13,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2018-09-20 15:24:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:24:13,894 INFO L225 Difference]: With dead ends: 711 [2018-09-20 15:24:13,899 INFO L226 Difference]: Without dead ends: 692 [2018-09-20 15:24:13,900 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-09-20 15:24:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-09-20 15:24:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 653. [2018-09-20 15:24:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-20 15:24:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 743 transitions. [2018-09-20 15:24:13,957 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 743 transitions. Word has length 116 [2018-09-20 15:24:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:24:13,958 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 743 transitions. [2018-09-20 15:24:13,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:24:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 743 transitions. [2018-09-20 15:24:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-20 15:24:13,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:24:13,962 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:24:13,962 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:24:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash -689984901, now seen corresponding path program 1 times [2018-09-20 15:24:13,963 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:24:13,963 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) [2018-09-20 15:24:13,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:24:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:24:14,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:24:14,365 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-20 15:24:14,371 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-20 15:24:14,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,404 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-20 15:24:14,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:24:14,437 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-20 15:24:14,443 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-20 15:24:14,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,476 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-20 15:24:14,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:24:14,556 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-20 15:24:14,560 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-20 15:24:14,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,584 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-20 15:24:14,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:24:14,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:24:14,644 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-20 15:24:14,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:14,673 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-20 15:24:14,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:24:15,210 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-20 15:24:15,214 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-20 15:24:15,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:15,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:15,229 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-20 15:24:15,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:24:15,310 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-20 15:24:15,314 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-20 15:24:15,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:15,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:15,321 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-20 15:24:15,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:24:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:24:15,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:24:15,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:24:15,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-20 15:24:15,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-20 15:24:15,756 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-20 15:24:15,757 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:24:15,757 INFO L87 Difference]: Start difference. First operand 653 states and 743 transitions. Second operand 18 states. [2018-09-20 15:24:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:24:33,329 INFO L93 Difference]: Finished difference Result 684 states and 776 transitions. [2018-09-20 15:24:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-20 15:24:33,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2018-09-20 15:24:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:24:33,335 INFO L225 Difference]: With dead ends: 684 [2018-09-20 15:24:33,335 INFO L226 Difference]: Without dead ends: 663 [2018-09-20 15:24:33,336 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2018-09-20 15:24:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-09-20 15:24:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 642. [2018-09-20 15:24:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-09-20 15:24:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 727 transitions. [2018-09-20 15:24:33,381 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 727 transitions. Word has length 122 [2018-09-20 15:24:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:24:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 727 transitions. [2018-09-20 15:24:33,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-20 15:24:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 727 transitions. [2018-09-20 15:24:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-20 15:24:33,385 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:24:33,385 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-20 15:24:33,385 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:24:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1839765624, now seen corresponding path program 1 times [2018-09-20 15:24:33,387 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:24:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:24:33,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:24:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:24:33,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:24:33,992 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-20 15:24:34,007 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-20 15:24:34,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:34,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:34,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-20 15:24:34,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:24:34,048 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-20 15:24:34,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-20 15:24:34,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:34,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:34,059 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-20 15:24:34,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:24:34,168 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-20 15:24:34,168 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:24:34,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:24:34,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:24:34,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:24:34,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:24:34,186 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:24:34,186 INFO L87 Difference]: Start difference. First operand 642 states and 727 transitions. Second operand 9 states. [2018-09-20 15:24:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:24:41,504 INFO L93 Difference]: Finished difference Result 772 states and 868 transitions. [2018-09-20 15:24:41,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:24:41,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-09-20 15:24:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:24:41,510 INFO L225 Difference]: With dead ends: 772 [2018-09-20 15:24:41,510 INFO L226 Difference]: Without dead ends: 750 [2018-09-20 15:24:41,511 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 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-20 15:24:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-09-20 15:24:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 642. [2018-09-20 15:24:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-09-20 15:24:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 724 transitions. [2018-09-20 15:24:41,554 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 724 transitions. Word has length 106 [2018-09-20 15:24:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:24:41,554 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 724 transitions. [2018-09-20 15:24:41,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:24:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 724 transitions. [2018-09-20 15:24:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-20 15:24:41,558 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:24:41,559 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-20 15:24:41,559 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:24:41,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2051116537, now seen corresponding path program 1 times [2018-09-20 15:24:41,559 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:24:41,559 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) [2018-09-20 15:24:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:24:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:24:41,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:24:42,021 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-20 15:24:42,027 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-20 15:24:42,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,059 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-20 15:24:42,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:24:42,085 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-20 15:24:42,090 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-20 15:24:42,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,122 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-20 15:24:42,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:24:42,204 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-20 15:24:42,209 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-20 15:24:42,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,248 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-20 15:24:42,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-09-20 15:24:42,308 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-20 15:24:42,320 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-20 15:24:42,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:24:42,358 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-20 15:24:42,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2018-09-20 15:24:42,896 WARN L178 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:24:45,051 WARN L797 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_5 (_ BitVec 32))) (= |c_fmod_float_#in~y| (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5)))) (exists ((v_prenex_8 (_ BitVec 32))) (and (= |c_fmod_float_#res| (let ((.cse0 (fp.mul RNE (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8)) |c_fmod_float_#in~y|))) (fp.div RNE .cse0 .cse0))) (not (bvslt (bvxor v_prenex_8 (bvand v_prenex_8 (_ bv2147483648 32))) (_ bv2139095040 32)))))) (and (exists ((v_fmod_float_~hx~0_58 (_ BitVec 32))) (= |c_fmod_float_#res| (let ((.cse1 (fp.mul RNE (fp ((_ extract 31 31) v_fmod_float_~hx~0_58) ((_ extract 30 23) v_fmod_float_~hx~0_58) ((_ extract 22 0) v_fmod_float_~hx~0_58)) |c_fmod_float_#in~y|))) (fp.div RNE .cse1 .cse1)))) (exists ((v_fmod_float_~hy~0_42 (_ BitVec 32))) (and (= (_ bv0 32) (bvand v_fmod_float_~hy~0_42 (_ bv2147483647 32))) (= (fp ((_ extract 31 31) v_fmod_float_~hy~0_42) ((_ extract 30 23) v_fmod_float_~hy~0_42) ((_ extract 22 0) v_fmod_float_~hy~0_42)) |c_fmod_float_#in~y|)))) (and (exists ((v_prenex_9 (_ BitVec 32))) (and (bvsgt (bvand v_prenex_9 (_ bv2147483647 32)) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9)) |c_fmod_float_#in~y|))) (exists ((v_prenex_12 (_ BitVec 32))) (= |c_fmod_float_#res| (let ((.cse2 (fp.mul RNE (fp ((_ extract 31 31) v_prenex_12) ((_ extract 30 23) v_prenex_12) ((_ extract 22 0) v_prenex_12)) |c_fmod_float_#in~y|))) (fp.div RNE .cse2 .cse2)))))) is different from false [2018-09-20 15:25:07,593 WARN L178 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 15:25:09,524 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-20 15:25:09,524 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:25:09,539 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:25:09,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:25:09,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:25:09,540 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:25:09,540 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=117, Unknown=8, NotChecked=22, Total=182 [2018-09-20 15:25:09,541 INFO L87 Difference]: Start difference. First operand 642 states and 724 transitions. Second operand 14 states. [2018-09-20 15:26:33,010 WARN L797 $PredicateComparison]: unable to prove that (and (or (and (exists ((v_prenex_5 (_ BitVec 32))) (= |c_fmod_float_#in~y| (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5)))) (exists ((v_prenex_8 (_ BitVec 32))) (and (= |c_fmod_float_#res| (let ((.cse0 (fp.mul RNE (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8)) |c_fmod_float_#in~y|))) (fp.div RNE .cse0 .cse0))) (not (bvslt (bvxor v_prenex_8 (bvand v_prenex_8 (_ bv2147483648 32))) (_ bv2139095040 32)))))) (and (exists ((v_fmod_float_~hx~0_58 (_ BitVec 32))) (= |c_fmod_float_#res| (let ((.cse1 (fp.mul RNE (fp ((_ extract 31 31) v_fmod_float_~hx~0_58) ((_ extract 30 23) v_fmod_float_~hx~0_58) ((_ extract 22 0) v_fmod_float_~hx~0_58)) |c_fmod_float_#in~y|))) (fp.div RNE .cse1 .cse1)))) (exists ((v_fmod_float_~hy~0_42 (_ BitVec 32))) (and (= (_ bv0 32) (bvand v_fmod_float_~hy~0_42 (_ bv2147483647 32))) (= (fp ((_ extract 31 31) v_fmod_float_~hy~0_42) ((_ extract 30 23) v_fmod_float_~hy~0_42) ((_ extract 22 0) v_fmod_float_~hy~0_42)) |c_fmod_float_#in~y|)))) (and (exists ((v_prenex_9 (_ BitVec 32))) (and (bvsgt (bvand v_prenex_9 (_ bv2147483647 32)) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9)) |c_fmod_float_#in~y|))) (exists ((v_prenex_12 (_ BitVec 32))) (= |c_fmod_float_#res| (let ((.cse2 (fp.mul RNE (fp ((_ extract 31 31) v_prenex_12) ((_ extract 30 23) v_prenex_12) ((_ extract 22 0) v_prenex_12)) |c_fmod_float_#in~y|))) (fp.div RNE .cse2 .cse2)))))) (= c_fmod_float_~y |c_fmod_float_#in~y|) (exists ((v_fmod_float_~hx~0_58 (_ BitVec 32))) (and (= c_fmod_float_~hx~0 (bvxor v_fmod_float_~hx~0_58 (bvand v_fmod_float_~hx~0_58 (_ bv2147483648 32)))) (= c_fmod_float_~x (fp ((_ extract 31 31) v_fmod_float_~hx~0_58) ((_ extract 30 23) v_fmod_float_~hx~0_58) ((_ extract 22 0) v_fmod_float_~hx~0_58))))) (exists ((v_fmod_float_~hy~0_42 (_ BitVec 32))) (and (= c_fmod_float_~hy~0 (bvand v_fmod_float_~hy~0_42 (_ bv2147483647 32))) (= (fp ((_ extract 31 31) v_fmod_float_~hy~0_42) ((_ extract 30 23) v_fmod_float_~hy~0_42) ((_ extract 22 0) v_fmod_float_~hy~0_42)) c_fmod_float_~y)))) is different from false [2018-09-20 15:26:52,934 WARN L178 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 23 [2018-09-20 15:27:03,450 WARN L178 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:27:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:27:10,681 INFO L93 Difference]: Finished difference Result 1188 states and 1337 transitions. [2018-09-20 15:27:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-20 15:27:10,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 106 [2018-09-20 15:27:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:27:10,686 INFO L225 Difference]: With dead ends: 1188 [2018-09-20 15:27:10,686 INFO L226 Difference]: Without dead ends: 642 [2018-09-20 15:27:10,688 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 54.3s TimeCoverageRelationStatistics Valid=86, Invalid=327, Unknown=15, NotChecked=78, Total=506 [2018-09-20 15:27:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-09-20 15:27:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-09-20 15:27:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-09-20 15:27:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 723 transitions. [2018-09-20 15:27:10,741 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 723 transitions. Word has length 106 [2018-09-20 15:27:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:27:10,742 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 723 transitions. [2018-09-20 15:27:10,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:27:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 723 transitions. [2018-09-20 15:27:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-20 15:27:10,746 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:27:10,747 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:27:10,747 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:27:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1760122050, now seen corresponding path program 1 times [2018-09-20 15:27:10,748 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:27:10,748 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-20 15:27:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-20 15:27:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:27:11,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:27:11,163 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-20 15:27:11,171 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-20 15:27:11,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,204 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-20 15:27:11,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:27:11,252 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-20 15:27:11,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-20 15:27:11,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,295 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-20 15:27:11,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:27:11,400 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-20 15:27:11,406 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-20 15:27:11,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,434 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-20 15:27:11,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:27:11,493 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-20 15:27:11,498 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-20 15:27:11,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:11,519 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-20 15:27:11,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:27:14,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:27:14,309 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-20 15:27:14,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:14,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:14,327 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-20 15:27:14,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:27:14,495 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-20 15:27:14,498 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-20 15:27:14,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:14,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:14,505 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-20 15:27:14,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:27:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:27:15,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:27:16,160 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-20 15:27:16,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:27:16,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:27:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:27:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:27:16,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:27:17,334 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-20 15:27:17,345 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-20 15:27:17,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:17,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:17,392 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-20 15:27:17,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:27:17,719 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-20 15:27:17,753 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-20 15:27:17,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:17,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:17,774 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-20 15:27:17,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:27:18,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-20 15:27:18,374 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-20 15:27:18,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:18,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:18,506 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-20 15:27:18,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:27:19,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-20 15:27:19,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:27:19,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:27:19,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:27:19,064 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-20 15:27:19,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:27:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:27:20,556 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:27:20,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-20 15:27:20,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [29] total 40 [2018-09-20 15:27:20,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-20 15:27:20,581 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-20 15:27:20,582 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2018-09-20 15:27:20,582 INFO L87 Difference]: Start difference. First operand 642 states and 723 transitions. Second operand 40 states. [2018-09-20 15:27:33,974 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-20 15:27:39,725 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-20 15:27:41,797 WARN L178 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-09-20 15:27:42,850 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:27:55,279 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-20 15:27:55,706 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:27:57,205 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:27:58,085 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-20 15:28:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:28:26,526 INFO L93 Difference]: Finished difference Result 1240 states and 1396 transitions. [2018-09-20 15:28:26,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-20 15:28:26,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 123 [2018-09-20 15:28:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:28:26,532 INFO L225 Difference]: With dead ends: 1240 [2018-09-20 15:28:26,532 INFO L226 Difference]: Without dead ends: 747 [2018-09-20 15:28:26,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=404, Invalid=7428, Unknown=0, NotChecked=0, Total=7832 [2018-09-20 15:28:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-09-20 15:28:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 646. [2018-09-20 15:28:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-09-20 15:28:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 729 transitions. [2018-09-20 15:28:26,588 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 729 transitions. Word has length 123 [2018-09-20 15:28:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:28:26,588 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 729 transitions. [2018-09-20 15:28:26,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-20 15:28:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 729 transitions. [2018-09-20 15:28:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-20 15:28:26,592 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:28:26,593 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-20 15:28:26,593 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:28:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash 565051345, now seen corresponding path program 1 times [2018-09-20 15:28:26,594 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:28:26,594 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-20 15:28:26,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:28:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:28:27,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:28:27,224 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-20 15:28:27,230 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-20 15:28:27,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,278 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-20 15:28:27,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:28:27,321 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-20 15:28:27,327 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-20 15:28:27,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,358 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-20 15:28:27,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:28:27,442 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-20 15:28:27,447 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-20 15:28:27,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,507 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-20 15:28:27,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:28:27,557 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-20 15:28:27,565 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-20 15:28:27,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:27,582 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-20 15:28:27,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:28:29,038 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-20 15:28:29,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-20 15:28:29,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:29,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:29,057 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-20 15:28:29,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:28:29,183 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-20 15:28:29,186 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-20 15:28:29,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:29,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:29,193 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-20 15:28:29,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:28:29,808 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-20 15:28:29,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:28:29,823 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:28:29,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:28:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:28:29,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:28:29,824 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:28:29,824 INFO L87 Difference]: Start difference. First operand 646 states and 729 transitions. Second operand 22 states. [2018-09-20 15:28:36,787 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 15:28:39,778 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-20 15:28:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:28:55,368 INFO L93 Difference]: Finished difference Result 686 states and 773 transitions. [2018-09-20 15:28:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-20 15:28:55,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-09-20 15:28:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:28:55,374 INFO L225 Difference]: With dead ends: 686 [2018-09-20 15:28:55,374 INFO L226 Difference]: Without dead ends: 667 [2018-09-20 15:28:55,375 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-09-20 15:28:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-09-20 15:28:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 657. [2018-09-20 15:28:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-09-20 15:28:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 743 transitions. [2018-09-20 15:28:55,433 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 743 transitions. Word has length 121 [2018-09-20 15:28:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:28:55,433 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 743 transitions. [2018-09-20 15:28:55,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:28:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 743 transitions. [2018-09-20 15:28:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-20 15:28:55,436 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:28:55,436 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-20 15:28:55,436 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:28:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 21459057, now seen corresponding path program 1 times [2018-09-20 15:28:55,437 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:28:55,437 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-20 15:28:55,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:28:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:28:55,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:28:55,956 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 15:28:56,235 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-20 15:28:56,248 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-20 15:28:56,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,389 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-20 15:28:56,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:28:56,584 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-20 15:28:56,599 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-20 15:28:56,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,698 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-20 15:28:56,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:28:56,802 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-20 15:28:56,807 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-20 15:28:56,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,831 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-20 15:28:56,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:28:56,897 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-20 15:28:56,902 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-20 15:28:56,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:56,919 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-20 15:28:56,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:28:58,097 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-20 15:28:58,102 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-20 15:28:58,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:58,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:58,117 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-20 15:28:58,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:28:58,239 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-20 15:28:58,243 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-20 15:28:58,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:28:58,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:28:58,253 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-20 15:28:58,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:28:58,668 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-20 15:28:58,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:28:58,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:28:58,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:28:58,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:28:58,682 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:28:58,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:28:58,684 INFO L87 Difference]: Start difference. First operand 657 states and 743 transitions. Second operand 22 states. [2018-09-20 15:29:04,878 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-20 15:29:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:29:17,281 INFO L93 Difference]: Finished difference Result 718 states and 811 transitions. [2018-09-20 15:29:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-20 15:29:17,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-09-20 15:29:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:29:17,288 INFO L225 Difference]: With dead ends: 718 [2018-09-20 15:29:17,288 INFO L226 Difference]: Without dead ends: 697 [2018-09-20 15:29:17,289 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=196, Invalid=1966, Unknown=0, NotChecked=0, Total=2162 [2018-09-20 15:29:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-09-20 15:29:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 657. [2018-09-20 15:29:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-09-20 15:29:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 742 transitions. [2018-09-20 15:29:17,354 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 742 transitions. Word has length 121 [2018-09-20 15:29:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:29:17,355 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 742 transitions. [2018-09-20 15:29:17,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:29:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 742 transitions. [2018-09-20 15:29:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-20 15:29:17,360 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:29:17,361 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:29:17,361 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:29:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 778913373, now seen corresponding path program 1 times [2018-09-20 15:29:17,364 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:29:17,365 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-20 15:29:17,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:29:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:29:17,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:29:18,097 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-20 15:29:18,110 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-20 15:29:18,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,155 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-20 15:29:18,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:29:18,198 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-20 15:29:18,208 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-20 15:29:18,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,238 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-20 15:29:18,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:29:18,320 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-20 15:29:18,325 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-20 15:29:18,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,350 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-20 15:29:18,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:29:18,401 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-20 15:29:18,406 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-20 15:29:18,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:18,420 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-20 15:29:18,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:29:19,107 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-20 15:29:19,118 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-20 15:29:19,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:19,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:19,136 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-20 15:29:19,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:29:19,240 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-20 15:29:19,245 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-20 15:29:19,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:19,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:19,251 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-20 15:29:19,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:29:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:29:19,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:29:19,733 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:29:19,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-20 15:29:19,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-20 15:29:19,734 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-20 15:29:19,734 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:29:19,735 INFO L87 Difference]: Start difference. First operand 657 states and 742 transitions. Second operand 18 states. [2018-09-20 15:29:22,533 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:29:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:29:37,601 INFO L93 Difference]: Finished difference Result 680 states and 765 transitions. [2018-09-20 15:29:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-20 15:29:37,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 126 [2018-09-20 15:29:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:29:37,605 INFO L225 Difference]: With dead ends: 680 [2018-09-20 15:29:37,605 INFO L226 Difference]: Without dead ends: 658 [2018-09-20 15:29:37,606 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2018-09-20 15:29:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-09-20 15:29:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 645. [2018-09-20 15:29:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-09-20 15:29:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 725 transitions. [2018-09-20 15:29:37,690 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 725 transitions. Word has length 126 [2018-09-20 15:29:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:29:37,690 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 725 transitions. [2018-09-20 15:29:37,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-20 15:29:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 725 transitions. [2018-09-20 15:29:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-20 15:29:37,695 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:29:37,696 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] [2018-09-20 15:29:37,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:29:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 657523398, now seen corresponding path program 1 times [2018-09-20 15:29:37,696 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:29:37,697 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) [2018-09-20 15:29:37,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-20 15:29:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:29:37,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:29:38,139 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-20 15:29:38,154 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-20 15:29:38,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,302 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-20 15:29:38,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:29:38,451 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-20 15:29:38,468 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-20 15:29:38,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,501 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-20 15:29:38,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:29:38,586 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-20 15:29:38,591 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-20 15:29:38,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,619 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-20 15:29:38,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:29:38,670 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-20 15:29:38,675 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-20 15:29:38,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:38,693 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-20 15:29:38,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:29:40,372 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-20 15:29:40,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:29:40,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:40,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:40,392 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-20 15:29:40,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:29:40,522 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-20 15:29:40,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:29:40,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:29:40,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:29:40,532 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-20 15:29:40,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:29:41,172 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-20 15:29:41,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:29:41,184 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:29:41,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-20 15:29:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-20 15:29:41,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-20 15:29:41,186 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:29:41,186 INFO L87 Difference]: Start difference. First operand 645 states and 725 transitions. Second operand 23 states. [2018-09-20 15:29:49,890 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-09-20 15:30:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:30:02,642 INFO L93 Difference]: Finished difference Result 712 states and 798 transitions. [2018-09-20 15:30:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-20 15:30:02,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 123 [2018-09-20 15:30:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:30:02,647 INFO L225 Difference]: With dead ends: 712 [2018-09-20 15:30:02,647 INFO L226 Difference]: Without dead ends: 693 [2018-09-20 15:30:02,648 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=0, NotChecked=0, Total=2256 [2018-09-20 15:30:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-09-20 15:30:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 656. [2018-09-20 15:30:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-09-20 15:30:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 739 transitions. [2018-09-20 15:30:02,714 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 739 transitions. Word has length 123 [2018-09-20 15:30:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:30:02,715 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 739 transitions. [2018-09-20 15:30:02,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-20 15:30:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 739 transitions. [2018-09-20 15:30:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-20 15:30:02,720 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:30:02,720 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:30:02,721 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:30:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash 20502098, now seen corresponding path program 1 times [2018-09-20 15:30:02,721 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:30:02,726 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) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-09-20 15:30:02,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:30:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:30:03,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:30:03,140 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-20 15:30:03,146 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-20 15:30:03,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,183 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-20 15:30:03,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:30:03,216 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-20 15:30:03,225 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-20 15:30:03,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,253 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-20 15:30:03,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:30:03,339 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-20 15:30:03,344 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-20 15:30:03,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,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-20 15:30:03,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:30:03,418 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-20 15:30:03,432 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-20 15:30:03,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:03,450 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-20 15:30:03,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:30:05,372 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-20 15:30:05,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:30:05,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:05,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:05,390 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-20 15:30:05,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:30:05,536 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-20 15:30:05,539 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-20 15:30:05,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:05,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:05,547 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-20 15:30:05,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:30:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:30:06,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:30:07,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:30:07,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:30:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:30:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:30:07,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:30:07,243 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-20 15:30:07,257 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-20 15:30:07,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,296 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-20 15:30:07,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:30:07,307 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-20 15:30:07,312 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-20 15:30:07,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,331 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-20 15:30:07,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:30:07,343 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-20 15:30:07,347 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-20 15:30:07,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,371 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-20 15:30:07,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:30:07,377 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-20 15:30:07,381 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-20 15:30:07,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:07,398 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-20 15:30:07,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:30:08,833 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-20 15:30:08,837 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-20 15:30:08,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:08,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:08,855 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-20 15:30:08,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:30:08,859 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-20 15:30:08,861 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-20 15:30:08,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:08,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:08,870 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-20 15:30:08,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:30:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:30:08,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:30:09,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:30:09,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-09-20 15:30:09,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-20 15:30:09,369 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-20 15:30:09,370 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2018-09-20 15:30:09,370 INFO L87 Difference]: Start difference. First operand 656 states and 739 transitions. Second operand 25 states. [2018-09-20 15:30:17,331 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:30:18,344 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-20 15:30:20,711 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-20 15:30:26,185 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-09-20 15:30:29,122 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:30:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:30:50,453 INFO L93 Difference]: Finished difference Result 815 states and 926 transitions. [2018-09-20 15:30:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-20 15:30:50,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2018-09-20 15:30:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:30:50,461 INFO L225 Difference]: With dead ends: 815 [2018-09-20 15:30:50,461 INFO L226 Difference]: Without dead ends: 796 [2018-09-20 15:30:50,463 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=238, Invalid=2731, Unknown=1, NotChecked=0, Total=2970 [2018-09-20 15:30:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-20 15:30:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 692. [2018-09-20 15:30:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-09-20 15:30:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 784 transitions. [2018-09-20 15:30:50,547 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 784 transitions. Word has length 128 [2018-09-20 15:30:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:30:50,549 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 784 transitions. [2018-09-20 15:30:50,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-20 15:30:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 784 transitions. [2018-09-20 15:30:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-20 15:30:50,552 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:30:50,553 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:30:50,553 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:30:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1613958790, now seen corresponding path program 1 times [2018-09-20 15:30:50,555 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:30:50,555 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-20 15:30:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:30:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:30:50,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:30:50,842 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-20 15:30:50,849 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-20 15:30:50,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:50,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:50,885 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-20 15:30:50,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:30:50,917 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-20 15:30:50,930 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-20 15:30:50,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:50,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:50,964 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-20 15:30:50,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:30:51,046 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-20 15:30:51,051 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-20 15:30:51,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:51,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:51,078 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-20 15:30:51,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:30:51,130 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-20 15:30:51,138 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-20 15:30:51,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:51,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:51,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-20 15:30:51,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:30:53,251 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-20 15:30:53,256 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-20 15:30:53,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:53,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:53,274 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-20 15:30:53,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:30:53,452 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-20 15:30:53,456 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-20 15:30:53,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:53,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:53,463 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-20 15:30:53,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:30:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:30:54,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:30:54,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:30:54,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:30:54,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:30:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:30:54,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:30:54,805 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-20 15:30:54,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-20 15:30:54,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,868 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-20 15:30:54,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-20 15:30:54,874 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-20 15:30:54,878 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-20 15:30:54,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,915 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-20 15:30:54,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-20 15:30:54,925 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-20 15:30:54,929 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-20 15:30:54,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,961 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-20 15:30:54,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-09-20 15:30:54,968 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-20 15:30:54,973 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-20 15:30:54,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:55,002 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-20 15:30:55,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-09-20 15:30:59,462 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-20 15:30:59,468 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-20 15:30:59,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:59,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:59,491 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-20 15:30:59,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:30:59,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-20 15:30:59,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-20 15:30:59,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:30:59,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:30:59,505 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-20 15:30:59,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:30:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:30:59,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:31:00,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:31:00,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 31 [2018-09-20 15:31:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-20 15:31:00,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-20 15:31:00,042 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-09-20 15:31:00,042 INFO L87 Difference]: Start difference. First operand 692 states and 784 transitions. Second operand 31 states. [2018-09-20 15:31:07,444 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:31:08,633 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-20 15:31:09,586 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-20 15:31:10,495 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-20 15:31:11,684 WARN L178 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-20 15:31:12,975 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-09-20 15:31:14,588 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-09-20 15:31:17,454 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-09-20 15:31:20,396 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-09-20 15:31:23,076 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-09-20 15:31:24,237 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-20 15:31:26,126 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-09-20 15:31:28,619 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:690) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Broken pipe at java.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-09-20 15:31:28,623 INFO L168 Benchmark]: Toolchain (without parser) took 615264.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 953.2 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 369.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:28,623 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:28,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.65 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 919.7 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:28,624 INFO L168 Benchmark]: Boogie Preprocessor took 243.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:28,624 INFO L168 Benchmark]: RCFGBuilder took 30980.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.2 MB in the end (delta: 146.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:28,625 INFO L168 Benchmark]: TraceAbstraction took 583266.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 996.2 MB in the beginning and 1.2 GB in the end (delta: -190.8 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:28,627 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 765.65 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 919.7 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 243.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 30980.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.2 MB in the end (delta: 146.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 583266.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 996.2 MB in the beginning and 1.2 GB in the end (delta: -190.8 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...