./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e748b563bb7a11726b28f7957ce1a00b7c8807b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e748b563bb7a11726b28f7957ce1a00b7c8807b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:12:48,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:12:48,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:12:48,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:12:48,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:12:48,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:12:48,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:12:48,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:12:49,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:12:49,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:12:49,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:12:49,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:12:49,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:12:49,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:12:49,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:12:49,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:12:49,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:12:49,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:12:49,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:12:49,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:12:49,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:12:49,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:12:49,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:12:49,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:12:49,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:12:49,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:12:49,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:12:49,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:12:49,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:12:49,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:12:49,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:12:49,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:12:49,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:12:49,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:12:49,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:12:49,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:12:49,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:12:49,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:12:49,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:12:49,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:12:49,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:12:49,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 12:12:49,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:12:49,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:12:49,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:12:49,036 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:12:49,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:12:49,036 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:12:49,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:12:49,036 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:12:49,036 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:12:49,037 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:12:49,037 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:12:49,037 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:12:49,037 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:12:49,037 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:12:49,038 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:12:49,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:12:49,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:12:49,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:12:49,039 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:12:49,039 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:12:49,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:12:49,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:12:49,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:12:49,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:12:49,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:12:49,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:12:49,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:12:49,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:12:49,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:12:49,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:12:49,042 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:12:49,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:12:49,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:12:49,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:12:49,042 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2019-12-07 12:12:49,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:12:49,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:12:49,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:12:49,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:12:49,163 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:12:49,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-12-07 12:12:49,208 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/fa4e45078/47961c6d5ed2486497861a89a161f524/FLAG991d7d799 [2019-12-07 12:12:49,559 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:12:49,559 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-12-07 12:12:49,569 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/fa4e45078/47961c6d5ed2486497861a89a161f524/FLAG991d7d799 [2019-12-07 12:12:49,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/fa4e45078/47961c6d5ed2486497861a89a161f524 [2019-12-07 12:12:49,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:12:49,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:12:49,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:12:49,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:12:49,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:12:49,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@939a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49, skipping insertion in model container [2019-12-07 12:12:49,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:12:49,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:12:49,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:12:49,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:12:49,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:12:49,878 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:12:49,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49 WrapperNode [2019-12-07 12:12:49,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:12:49,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:12:49,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:12:49,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:12:49,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:12:49,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:12:49,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:12:49,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:12:49,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... [2019-12-07 12:12:49,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:12:49,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:12:49,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:12:49,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:12:49,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:12:49,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:12:50,278 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:12:50,278 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 12:12:50,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:12:50 BoogieIcfgContainer [2019-12-07 12:12:50,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:12:50,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:12:50,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:12:50,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:12:50,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:12:49" (1/3) ... [2019-12-07 12:12:50,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f02f2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:12:50, skipping insertion in model container [2019-12-07 12:12:50,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:12:49" (2/3) ... [2019-12-07 12:12:50,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f02f2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:12:50, skipping insertion in model container [2019-12-07 12:12:50,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:12:50" (3/3) ... [2019-12-07 12:12:50,283 INFO L109 eAbstractionObserver]: Analyzing ICFG substring-alloca-2.i [2019-12-07 12:12:50,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:12:50,294 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 12:12:50,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 12:12:50,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:12:50,314 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:12:50,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:12:50,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:12:50,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:12:50,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:12:50,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:12:50,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:12:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-12-07 12:12:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:12:50,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:12:50,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 155459, now seen corresponding path program 1 times [2019-12-07 12:12:50,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613819603] [2019-12-07 12:12:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613819603] [2019-12-07 12:12:50,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:12:50,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717678102] [2019-12-07 12:12:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:12:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:12:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,465 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-12-07 12:12:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,506 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-12-07 12:12:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:12:50,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:12:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,513 INFO L225 Difference]: With dead ends: 37 [2019-12-07 12:12:50,513 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 12:12:50,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 12:12:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 12:12:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 12:12:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-12-07 12:12:50,536 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 3 [2019-12-07 12:12:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,536 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 12:12:50,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:12:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-12-07 12:12:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:12:50,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:12:50,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash 155460, now seen corresponding path program 1 times [2019-12-07 12:12:50,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15818539] [2019-12-07 12:12:50,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15818539] [2019-12-07 12:12:50,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:12:50,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888578285] [2019-12-07 12:12:50,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:12:50,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:12:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:12:50,585 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-12-07 12:12:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,667 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-12-07 12:12:50,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:12:50,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 12:12:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,669 INFO L225 Difference]: With dead ends: 70 [2019-12-07 12:12:50,669 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 12:12:50,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 12:12:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-12-07 12:12:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:12:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-12-07 12:12:50,673 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 3 [2019-12-07 12:12:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,674 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-12-07 12:12:50,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:12:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-12-07 12:12:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:12:50,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:12:50,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 4928278, now seen corresponding path program 1 times [2019-12-07 12:12:50,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573720368] [2019-12-07 12:12:50,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573720368] [2019-12-07 12:12:50,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:12:50,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192512439] [2019-12-07 12:12:50,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:12:50,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:12:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,720 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 3 states. [2019-12-07 12:12:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,742 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-12-07 12:12:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:12:50,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:12:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,744 INFO L225 Difference]: With dead ends: 37 [2019-12-07 12:12:50,744 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 12:12:50,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 12:12:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 12:12:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 12:12:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-12-07 12:12:50,748 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 4 [2019-12-07 12:12:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,748 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-12-07 12:12:50,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:12:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-12-07 12:12:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:12:50,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:12:50,749 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash 4925478, now seen corresponding path program 1 times [2019-12-07 12:12:50,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661435366] [2019-12-07 12:12:50,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661435366] [2019-12-07 12:12:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:12:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29477669] [2019-12-07 12:12:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:12:50,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:12:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,772 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 3 states. [2019-12-07 12:12:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,792 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-12-07 12:12:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:12:50,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:12:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,792 INFO L225 Difference]: With dead ends: 35 [2019-12-07 12:12:50,792 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 12:12:50,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 12:12:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 12:12:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 12:12:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-12-07 12:12:50,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 4 [2019-12-07 12:12:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,795 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-12-07 12:12:50,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:12:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-12-07 12:12:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:12:50,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:12:50,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash 4925479, now seen corresponding path program 1 times [2019-12-07 12:12:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827648301] [2019-12-07 12:12:50,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827648301] [2019-12-07 12:12:50,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:50,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122425835] [2019-12-07 12:12:50,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:12:50,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:12:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:50,834 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2019-12-07 12:12:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,892 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-12-07 12:12:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:12:50,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 12:12:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,893 INFO L225 Difference]: With dead ends: 63 [2019-12-07 12:12:50,893 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 12:12:50,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:12:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 12:12:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-12-07 12:12:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 12:12:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-12-07 12:12:50,896 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 4 [2019-12-07 12:12:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,897 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-12-07 12:12:50,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:12:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-12-07 12:12:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:12:50,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:12:50,897 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash 152776612, now seen corresponding path program 1 times [2019-12-07 12:12:50,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646212531] [2019-12-07 12:12:50,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646212531] [2019-12-07 12:12:50,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:50,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:12:50,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260720319] [2019-12-07 12:12:50,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:12:50,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:50,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:12:50,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,923 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2019-12-07 12:12:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:50,942 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 12:12:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:12:50,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:12:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:50,943 INFO L225 Difference]: With dead ends: 36 [2019-12-07 12:12:50,943 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 12:12:50,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 12:12:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 12:12:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 12:12:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-12-07 12:12:50,946 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 5 [2019-12-07 12:12:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:50,946 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-12-07 12:12:50,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:12:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-12-07 12:12:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:12:50,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:50,946 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 12:12:50,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash 149491977, now seen corresponding path program 1 times [2019-12-07 12:12:50,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:50,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469594371] [2019-12-07 12:12:50,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:50,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469594371] [2019-12-07 12:12:50,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805589529] [2019-12-07 12:12:50,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:12:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:51,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:12:51,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:12:51,060 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_40|], 2=[|v_#valid_64|]} [2019-12-07 12:12:51,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:12:51,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:12:51,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:51,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:12:51,089 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-07 12:12:51,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:12:51,106 INFO L614 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-12-07 12:12:51,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:12:51,108 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-12-07 12:12:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:51,126 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:12:51,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:12:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:51,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712247591] [2019-12-07 12:12:51,185 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 12:12:51,185 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:12:51,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:12:51,193 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:12:51,194 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:12:51,544 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:51,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:51,713 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:12:51,977 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:12:51,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:12:51,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 12:12:51,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986963146] [2019-12-07 12:12:51,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:12:51,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:12:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:12:51,978 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 9 states. [2019-12-07 12:12:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:52,128 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-12-07 12:12:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:12:52,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 12:12:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:52,129 INFO L225 Difference]: With dead ends: 96 [2019-12-07 12:12:52,129 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 12:12:52,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:12:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 12:12:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 33. [2019-12-07 12:12:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:12:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-12-07 12:12:52,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 5 [2019-12-07 12:12:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:52,133 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-12-07 12:12:52,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:12:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-12-07 12:12:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:12:52,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:52,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 12:12:52,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:12:52,334 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash 441109693, now seen corresponding path program 1 times [2019-12-07 12:12:52,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:52,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625387161] [2019-12-07 12:12:52,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:52,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625387161] [2019-12-07 12:12:52,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:52,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:52,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71228981] [2019-12-07 12:12:52,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:12:52,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:12:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:52,426 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 5 states. [2019-12-07 12:12:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:52,556 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-12-07 12:12:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:12:52,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 12:12:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:52,558 INFO L225 Difference]: With dead ends: 55 [2019-12-07 12:12:52,558 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 12:12:52,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:12:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 12:12:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2019-12-07 12:12:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 12:12:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-12-07 12:12:52,564 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 6 [2019-12-07 12:12:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:52,564 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-12-07 12:12:52,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:12:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-12-07 12:12:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:12:52,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:52,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 12:12:52,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 441109692, now seen corresponding path program 1 times [2019-12-07 12:12:52,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:52,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410369521] [2019-12-07 12:12:52,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:52,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410369521] [2019-12-07 12:12:52,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:52,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:52,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359017598] [2019-12-07 12:12:52,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:12:52,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:12:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:12:52,590 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2019-12-07 12:12:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:52,618 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-12-07 12:12:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:12:52,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 12:12:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:52,618 INFO L225 Difference]: With dead ends: 33 [2019-12-07 12:12:52,618 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 12:12:52,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 12:12:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 12:12:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:12:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-12-07 12:12:52,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 6 [2019-12-07 12:12:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:52,621 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-12-07 12:12:52,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:12:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-12-07 12:12:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:12:52,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:52,621 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 12:12:52,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:52,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash 438495257, now seen corresponding path program 1 times [2019-12-07 12:12:52,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:52,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411397749] [2019-12-07 12:12:52,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:52,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411397749] [2019-12-07 12:12:52,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780784501] [2019-12-07 12:12:52,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:12:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:52,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:12:52,677 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:12:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:52,718 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:12:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:52,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1568233310] [2019-12-07 12:12:52,762 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 12:12:52,763 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:12:52,763 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:12:52,763 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:12:52,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:12:52,984 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:53,007 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:53,092 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:12:53,348 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:12:53,501 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:12:53,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:12:53,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 12:12:53,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860310217] [2019-12-07 12:12:53,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:12:53,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:12:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:12:53,502 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 10 states. [2019-12-07 12:12:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:53,736 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-07 12:12:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:12:53,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 12:12:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:53,738 INFO L225 Difference]: With dead ends: 83 [2019-12-07 12:12:53,738 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 12:12:53,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:12:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 12:12:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 30. [2019-12-07 12:12:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 12:12:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 12:12:53,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2019-12-07 12:12:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:53,745 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 12:12:53,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:12:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-12-07 12:12:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:12:53,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:53,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:53,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:12:53,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1295347039, now seen corresponding path program 1 times [2019-12-07 12:12:53,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:53,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519775672] [2019-12-07 12:12:53,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:53,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519775672] [2019-12-07 12:12:53,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:53,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:53,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575244857] [2019-12-07 12:12:53,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:12:53,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:12:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:12:53,994 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-12-07 12:12:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,031 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-12-07 12:12:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:12:54,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:12:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,032 INFO L225 Difference]: With dead ends: 30 [2019-12-07 12:12:54,032 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 12:12:54,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 12:12:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-12-07 12:12:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:12:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 12:12:54,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2019-12-07 12:12:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,034 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 12:12:54,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:12:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-12-07 12:12:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:12:54,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,035 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1295347038, now seen corresponding path program 1 times [2019-12-07 12:12:54,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797233005] [2019-12-07 12:12:54,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797233005] [2019-12-07 12:12:54,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:54,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740689670] [2019-12-07 12:12:54,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:12:54,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:12:54,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:54,069 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 5 states. [2019-12-07 12:12:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,123 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-12-07 12:12:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:12:54,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 12:12:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,124 INFO L225 Difference]: With dead ends: 43 [2019-12-07 12:12:54,124 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:12:54,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:12:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:12:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-12-07 12:12:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:12:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-12-07 12:12:54,126 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 8 [2019-12-07 12:12:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,127 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-12-07 12:12:54,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:12:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-12-07 12:12:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:12:54,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash 711989000, now seen corresponding path program 1 times [2019-12-07 12:12:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465296501] [2019-12-07 12:12:54,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465296501] [2019-12-07 12:12:54,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:12:54,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689440278] [2019-12-07 12:12:54,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:12:54,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:12:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:12:54,169 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 4 states. [2019-12-07 12:12:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,189 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-12-07 12:12:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:12:54,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 12:12:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,190 INFO L225 Difference]: With dead ends: 32 [2019-12-07 12:12:54,190 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 12:12:54,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:12:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 12:12:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 12:12:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 12:12:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-12-07 12:12:54,191 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 10 [2019-12-07 12:12:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,192 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-12-07 12:12:54,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:12:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-12-07 12:12:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:12:54,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,192 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 598995364, now seen corresponding path program 1 times [2019-12-07 12:12:54,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686514173] [2019-12-07 12:12:54,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686514173] [2019-12-07 12:12:54,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:12:54,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12623495] [2019-12-07 12:12:54,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:12:54,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:12:54,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:54,211 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-12-07 12:12:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,241 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-12-07 12:12:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:12:54,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:12:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,242 INFO L225 Difference]: With dead ends: 29 [2019-12-07 12:12:54,242 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 12:12:54,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:12:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 12:12:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-12-07 12:12:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 12:12:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-12-07 12:12:54,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2019-12-07 12:12:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,243 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-12-07 12:12:54,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:12:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-12-07 12:12:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:12:54,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,244 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash 598995365, now seen corresponding path program 1 times [2019-12-07 12:12:54,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413691416] [2019-12-07 12:12:54,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413691416] [2019-12-07 12:12:54,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:12:54,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695955816] [2019-12-07 12:12:54,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:12:54,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:12:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:12:54,275 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-12-07 12:12:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,334 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-12-07 12:12:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:12:54,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 12:12:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,335 INFO L225 Difference]: With dead ends: 50 [2019-12-07 12:12:54,335 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:12:54,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:12:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:12:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2019-12-07 12:12:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:12:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-12-07 12:12:54,337 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 11 [2019-12-07 12:12:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,337 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-12-07 12:12:54,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:12:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-12-07 12:12:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:12:54,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,338 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 599004438, now seen corresponding path program 1 times [2019-12-07 12:12:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123166034] [2019-12-07 12:12:54,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123166034] [2019-12-07 12:12:54,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:12:54,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257110673] [2019-12-07 12:12:54,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:12:54,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:12:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:54,348 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 3 states. [2019-12-07 12:12:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,354 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-12-07 12:12:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:12:54,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:12:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,355 INFO L225 Difference]: With dead ends: 35 [2019-12-07 12:12:54,355 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 12:12:54,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:12:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 12:12:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 12:12:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 12:12:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-12-07 12:12:54,356 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2019-12-07 12:12:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,357 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-12-07 12:12:54,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:12:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-12-07 12:12:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:12:54,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,357 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash 108964757, now seen corresponding path program 1 times [2019-12-07 12:12:54,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578087513] [2019-12-07 12:12:54,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578087513] [2019-12-07 12:12:54,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:12:54,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070164935] [2019-12-07 12:12:54,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:12:54,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:12:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:12:54,512 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 11 states. [2019-12-07 12:12:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,810 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-12-07 12:12:54,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:12:54,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-12-07 12:12:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,812 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:12:54,812 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 12:12:54,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:12:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 12:12:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 46. [2019-12-07 12:12:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:12:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-12-07 12:12:54,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 13 [2019-12-07 12:12:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,815 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-12-07 12:12:54,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:12:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-12-07 12:12:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:12:54,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,816 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash 117613125, now seen corresponding path program 1 times [2019-12-07 12:12:54,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256099039] [2019-12-07 12:12:54,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256099039] [2019-12-07 12:12:54,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:12:54,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428147628] [2019-12-07 12:12:54,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:12:54,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:12:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:12:54,844 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 5 states. [2019-12-07 12:12:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:54,868 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-12-07 12:12:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:12:54,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:12:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:54,869 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:12:54,869 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 12:12:54,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:12:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 12:12:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-12-07 12:12:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 12:12:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-12-07 12:12:54,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 13 [2019-12-07 12:12:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:54,871 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-12-07 12:12:54,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:12:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-12-07 12:12:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:12:54,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:54,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:54,871 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1635882244, now seen corresponding path program 1 times [2019-12-07 12:12:54,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:54,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382007] [2019-12-07 12:12:54,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:12:54,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382007] [2019-12-07 12:12:54,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:54,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:12:54,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676409427] [2019-12-07 12:12:54,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:12:54,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:12:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:12:54,968 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 7 states. [2019-12-07 12:12:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:55,039 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-12-07 12:12:55,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:12:55,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 12:12:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:55,039 INFO L225 Difference]: With dead ends: 43 [2019-12-07 12:12:55,039 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 12:12:55,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:12:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 12:12:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-12-07 12:12:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 12:12:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-12-07 12:12:55,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 15 [2019-12-07 12:12:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:55,041 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-12-07 12:12:55,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:12:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-12-07 12:12:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:12:55,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:55,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:55,042 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1534700314, now seen corresponding path program 1 times [2019-12-07 12:12:55,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:55,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911180464] [2019-12-07 12:12:55,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:12:55,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911180464] [2019-12-07 12:12:55,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:12:55,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:12:55,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922871435] [2019-12-07 12:12:55,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:12:55,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:12:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:12:55,151 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 8 states. [2019-12-07 12:12:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:12:55,224 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-12-07 12:12:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:12:55,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 12:12:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:12:55,225 INFO L225 Difference]: With dead ends: 44 [2019-12-07 12:12:55,225 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 12:12:55,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:12:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 12:12:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-12-07 12:12:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 12:12:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-12-07 12:12:55,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 15 [2019-12-07 12:12:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:12:55,226 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-12-07 12:12:55,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:12:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-12-07 12:12:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:12:55,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:12:55,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:12:55,227 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:12:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:12:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash -913052120, now seen corresponding path program 1 times [2019-12-07 12:12:55,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:12:55,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257830851] [2019-12-07 12:12:55,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:12:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:12:55,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257830851] [2019-12-07 12:12:55,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261882841] [2019-12-07 12:12:55,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:12:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:12:55,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:12:55,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:12:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:12:55,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:12:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:12:55,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1789166350] [2019-12-07 12:12:55,424 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:12:55,424 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:12:55,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:12:55,425 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:12:55,425 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:12:55,631 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:55,652 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:55,903 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:55,908 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:12:56,398 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:12:56,601 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 12:12:56,989 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:12:57,320 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:12:57,636 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:12:58,429 WARN L192 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:12:59,240 WARN L192 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:12:59,477 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:12:59,694 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:12:59,960 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:12:59,961 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:12:59,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:12:59,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2019-12-07 12:12:59,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720138511] [2019-12-07 12:12:59,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:12:59,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:12:59,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:12:59,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:12:59,962 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 17 states. [2019-12-07 12:13:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:00,135 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-12-07 12:13:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:13:00,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-12-07 12:13:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:00,136 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:13:00,136 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 12:13:00,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:13:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 12:13:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-12-07 12:13:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:13:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 12:13:00,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2019-12-07 12:13:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:00,139 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 12:13:00,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:13:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 12:13:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:13:00,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:00,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:00,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:00,340 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:13:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1269793065, now seen corresponding path program 1 times [2019-12-07 12:13:00,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:13:00,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20146352] [2019-12-07 12:13:00,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:00,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20146352] [2019-12-07 12:13:00,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438101707] [2019-12-07 12:13:00,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:00,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:13:00,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:13:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:00,481 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:13:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:00,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1198497622] [2019-12-07 12:13:00,565 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:13:00,565 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:13:00,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:13:00,566 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:13:00,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:13:00,748 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:00,761 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:00,986 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:00,997 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:01,568 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:13:01,727 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-12-07 12:13:02,224 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:13:02,603 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:13:02,928 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:13:03,074 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 12:13:03,245 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 12:13:03,417 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:13:03,663 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:13:03,945 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:13:04,334 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 12:13:04,622 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-12-07 12:13:04,623 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:13:04,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:13:04,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2019-12-07 12:13:04,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58973495] [2019-12-07 12:13:04,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:13:04,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:13:04,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:13:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2019-12-07 12:13:04,624 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 17 states. [2019-12-07 12:13:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:04,778 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-12-07 12:13:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:13:04,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-12-07 12:13:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:04,779 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:13:04,779 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 12:13:04,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:13:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 12:13:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-12-07 12:13:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:13:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-12-07 12:13:04,781 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 19 [2019-12-07 12:13:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:04,781 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-12-07 12:13:04,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:13:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-12-07 12:13:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:13:04,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:04,782 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:04,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:04,983 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:13:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -706371489, now seen corresponding path program 1 times [2019-12-07 12:13:04,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:13:04,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786638400] [2019-12-07 12:13:04,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:05,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786638400] [2019-12-07 12:13:05,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41659272] [2019-12-07 12:13:05,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:05,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 12:13:05,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:13:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:05,144 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:13:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:05,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616380281] [2019-12-07 12:13:05,223 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:13:05,223 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:13:05,224 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:13:05,224 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:13:05,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:13:05,419 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:05,424 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:05,624 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:05,637 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:06,047 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:13:06,253 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-12-07 12:13:06,839 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:13:07,072 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 12:13:07,872 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:13:08,632 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:13:09,470 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:13:10,451 WARN L192 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:13:10,695 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:13:10,920 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:13:11,193 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:13:11,194 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:13:11,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:13:11,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2019-12-07 12:13:11,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986849377] [2019-12-07 12:13:11,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 12:13:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:13:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 12:13:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:13:11,195 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 20 states. [2019-12-07 12:13:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:11,629 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-12-07 12:13:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:13:11,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-12-07 12:13:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:11,631 INFO L225 Difference]: With dead ends: 57 [2019-12-07 12:13:11,631 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 12:13:11,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 12:13:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 12:13:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-12-07 12:13:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:13:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-12-07 12:13:11,635 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 20 [2019-12-07 12:13:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:11,636 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-12-07 12:13:11,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 12:13:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-12-07 12:13:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:13:11,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:11,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:11,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:11,838 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:13:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash -218131505, now seen corresponding path program 2 times [2019-12-07 12:13:11,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:13:11,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362070689] [2019-12-07 12:13:11,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:11,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362070689] [2019-12-07 12:13:11,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564688191] [2019-12-07 12:13:11,970 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:13:12,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:13:12,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:13:12,021 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 12:13:12,022 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:13:14,300 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 12:13:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:14,416 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:13:14,802 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2019-12-07 12:13:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:13:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [589537364] [2019-12-07 12:13:14,924 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:13:14,924 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:13:14,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:13:14,925 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:13:14,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:13:15,116 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:15,139 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:15,372 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:15,378 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:13:15,877 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:13:16,097 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 12:13:16,567 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:13:16,985 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:13:17,359 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:13:18,243 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:13:19,177 WARN L192 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:13:19,396 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:13:19,639 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:13:19,942 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:13:19,942 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:13:19,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:13:19,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2019-12-07 12:13:19,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920074007] [2019-12-07 12:13:19,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 12:13:19,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:13:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 12:13:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 12:13:19,944 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 32 states. [2019-12-07 12:13:23,005 WARN L192 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-07 12:13:33,066 WARN L192 SmtUtils]: Spent 9.96 s on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-12-07 12:13:37,547 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-12-07 12:13:47,387 WARN L192 SmtUtils]: Spent 9.77 s on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-12-07 12:13:53,601 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-12-07 12:13:53,773 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-07 12:13:58,086 WARN L192 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-12-07 12:13:58,484 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:02,966 WARN L192 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-12-07 12:14:03,222 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-12-07 12:14:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:03,301 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-12-07 12:14:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 12:14:03,301 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 22 [2019-12-07 12:14:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:03,302 INFO L225 Difference]: With dead ends: 154 [2019-12-07 12:14:03,302 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 12:14:03,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=733, Invalid=4523, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 12:14:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 12:14:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2019-12-07 12:14:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 12:14:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2019-12-07 12:14:03,306 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 22 [2019-12-07 12:14:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:03,306 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2019-12-07 12:14:03,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 12:14:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2019-12-07 12:14:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:14:03,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:03,307 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:03,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:03,508 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -271876149, now seen corresponding path program 1 times [2019-12-07 12:14:03,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:03,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309881779] [2019-12-07 12:14:03,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:03,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309881779] [2019-12-07 12:14:03,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401018730] [2019-12-07 12:14:03,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:03,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 12:14:03,607 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:03,650 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:03,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1219703922] [2019-12-07 12:14:03,734 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:14:03,734 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:03,735 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:03,735 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:03,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:03,940 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:03,944 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:04,110 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:04,145 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:04,673 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:04,884 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-12-07 12:14:05,275 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:05,656 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:06,030 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:06,181 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 12:14:06,362 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 12:14:06,548 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:06,773 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:07,043 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:07,284 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 12:14:07,558 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-12-07 12:14:07,558 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:07,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:07,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2019-12-07 12:14:07,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119966014] [2019-12-07 12:14:07,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:14:07,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:14:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 12:14:07,560 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand 19 states. [2019-12-07 12:14:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:08,257 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2019-12-07 12:14:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:14:08,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-12-07 12:14:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:08,259 INFO L225 Difference]: With dead ends: 157 [2019-12-07 12:14:08,259 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 12:14:08,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=372, Invalid=1790, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 12:14:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 12:14:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-12-07 12:14:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 12:14:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2019-12-07 12:14:08,262 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 24 [2019-12-07 12:14:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:08,262 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2019-12-07 12:14:08,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:14:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2019-12-07 12:14:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:14:08,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:08,262 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:08,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:08,464 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1904283556, now seen corresponding path program 3 times [2019-12-07 12:14:08,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:08,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612371952] [2019-12-07 12:14:08,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:08,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612371952] [2019-12-07 12:14:08,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348123560] [2019-12-07 12:14:08,548 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:08,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:14:08,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:14:08,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 12:14:08,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:08,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:08,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1364431716] [2019-12-07 12:14:08,859 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:14:08,859 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:08,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:08,859 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:08,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:09,065 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:09,070 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:09,268 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:09,274 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:09,750 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:09,939 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 12:14:10,351 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:10,718 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:11,064 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:11,895 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:14:12,813 WARN L192 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:14:13,066 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:13,301 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:13,579 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:13,580 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:13,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:13,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 24 [2019-12-07 12:14:13,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900494738] [2019-12-07 12:14:13,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 12:14:13,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 12:14:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:14:13,581 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 26 states. [2019-12-07 12:14:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:13,916 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2019-12-07 12:14:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:14:13,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-12-07 12:14:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:13,918 INFO L225 Difference]: With dead ends: 156 [2019-12-07 12:14:13,918 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 12:14:13,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 12:14:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 12:14:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 114. [2019-12-07 12:14:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 12:14:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2019-12-07 12:14:13,922 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 26 [2019-12-07 12:14:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:13,922 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2019-12-07 12:14:13,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 12:14:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2019-12-07 12:14:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:14:13,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:13,923 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:14,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:14,124 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash 490315818, now seen corresponding path program 2 times [2019-12-07 12:14:14,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:14,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042195225] [2019-12-07 12:14:14,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:14,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042195225] [2019-12-07 12:14:14,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813636383] [2019-12-07 12:14:14,292 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:14,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:14:14,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:14:14,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 12:14:14,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:14,456 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:14,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001253812] [2019-12-07 12:14:14,581 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:14:14,581 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:14,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:14,581 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:14,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:14,777 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:14,782 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:14,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:15,015 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:15,596 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:15,760 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-12-07 12:14:15,996 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-12-07 12:14:16,446 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:16,613 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 12:14:17,101 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:17,470 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:17,629 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 12:14:17,806 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 12:14:17,992 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:18,219 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:18,507 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:18,748 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 12:14:19,011 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-12-07 12:14:19,012 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:19,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:19,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2019-12-07 12:14:19,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576978546] [2019-12-07 12:14:19,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:14:19,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:14:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1197, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 12:14:19,013 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 23 states. [2019-12-07 12:14:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:19,322 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2019-12-07 12:14:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:14:19,322 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-12-07 12:14:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:19,323 INFO L225 Difference]: With dead ends: 115 [2019-12-07 12:14:19,323 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 12:14:19,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 12:14:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 12:14:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-12-07 12:14:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 12:14:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-12-07 12:14:19,325 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 28 [2019-12-07 12:14:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:19,325 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-12-07 12:14:19,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:14:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-12-07 12:14:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:14:19,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:19,326 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:19,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:19,527 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1713045931, now seen corresponding path program 2 times [2019-12-07 12:14:19,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:19,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296957032] [2019-12-07 12:14:19,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:19,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296957032] [2019-12-07 12:14:19,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936245083] [2019-12-07 12:14:19,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:19,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:14:19,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:14:19,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 12:14:19,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:19,779 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:19,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1066788] [2019-12-07 12:14:19,945 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:14:19,946 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:19,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:19,946 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:19,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:20,127 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:20,145 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:20,323 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:20,327 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:20,763 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:20,991 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-12-07 12:14:21,469 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:21,645 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 12:14:22,291 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:22,702 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:23,569 WARN L192 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:14:24,483 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:14:24,689 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:24,924 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:25,219 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:25,220 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:25,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:25,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2019-12-07 12:14:25,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146405575] [2019-12-07 12:14:25,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 12:14:25,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 12:14:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1276, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:14:25,221 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 26 states. [2019-12-07 12:14:27,059 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 12:14:27,396 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-07 12:14:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:27,543 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2019-12-07 12:14:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 12:14:27,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-07 12:14:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:27,547 INFO L225 Difference]: With dead ends: 148 [2019-12-07 12:14:27,547 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 12:14:27,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=610, Invalid=4220, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 12:14:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 12:14:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2019-12-07 12:14:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 12:14:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-12-07 12:14:27,557 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 29 [2019-12-07 12:14:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:27,558 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-12-07 12:14:27,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 12:14:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-12-07 12:14:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:14:27,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:27,559 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:27,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:27,761 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1908999685, now seen corresponding path program 3 times [2019-12-07 12:14:27,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:27,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134111818] [2019-12-07 12:14:27,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:27,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134111818] [2019-12-07 12:14:27,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806944326] [2019-12-07 12:14:27,824 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:27,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:14:27,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:14:27,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 12:14:27,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:27,950 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:28,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990539646] [2019-12-07 12:14:28,043 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:14:28,043 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:28,043 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:28,043 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:28,043 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:28,219 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:28,224 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:28,436 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:28,442 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:29,101 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:29,254 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-12-07 12:14:30,110 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:30,628 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:31,167 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:31,595 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 12:14:32,133 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 12:14:32,317 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:32,589 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:32,913 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:33,156 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 12:14:33,421 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-12-07 12:14:33,422 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:33,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:33,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-12-07 12:14:33,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708795287] [2019-12-07 12:14:33,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 12:14:33,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 12:14:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 12:14:33,423 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 21 states. [2019-12-07 12:14:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:33,669 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2019-12-07 12:14:33,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:14:33,670 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-12-07 12:14:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:33,670 INFO L225 Difference]: With dead ends: 204 [2019-12-07 12:14:33,670 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 12:14:33,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:14:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 12:14:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2019-12-07 12:14:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 12:14:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2019-12-07 12:14:33,674 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 30 [2019-12-07 12:14:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:33,674 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2019-12-07 12:14:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 12:14:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2019-12-07 12:14:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:14:33,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:33,674 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:33,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:33,875 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -186153921, now seen corresponding path program 1 times [2019-12-07 12:14:33,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:33,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910152503] [2019-12-07 12:14:33,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:33,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910152503] [2019-12-07 12:14:33,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342442143] [2019-12-07 12:14:33,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:33,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 12:14:33,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:34,039 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:34,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652598633] [2019-12-07 12:14:34,143 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:14:34,143 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:34,143 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:34,143 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:34,143 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:34,329 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:34,339 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:34,545 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:34,549 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:35,208 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:35,415 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 12:14:36,179 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:36,463 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 12:14:36,841 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:37,244 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:37,445 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 12:14:37,721 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 12:14:37,983 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-12-07 12:14:38,488 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-12-07 12:14:38,787 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-12-07 12:14:39,030 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-12-07 12:14:39,287 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-12-07 12:14:39,498 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:39,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:39,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2019-12-07 12:14:39,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022025238] [2019-12-07 12:14:39,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 12:14:39,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 12:14:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1103, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:14:39,499 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand 22 states. [2019-12-07 12:14:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:39,932 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2019-12-07 12:14:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:14:39,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-12-07 12:14:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:39,933 INFO L225 Difference]: With dead ends: 183 [2019-12-07 12:14:39,933 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 12:14:39,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=418, Invalid=2032, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 12:14:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 12:14:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-12-07 12:14:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 12:14:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-12-07 12:14:39,937 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 33 [2019-12-07 12:14:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:39,937 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-12-07 12:14:39,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 12:14:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-12-07 12:14:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:14:39,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:39,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:40,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:40,139 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:40,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:40,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2026592105, now seen corresponding path program 4 times [2019-12-07 12:14:40,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:40,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432178224] [2019-12-07 12:14:40,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:40,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432178224] [2019-12-07 12:14:40,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788774190] [2019-12-07 12:14:40,257 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:40,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 12:14:40,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:40,359 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:40,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [603643847] [2019-12-07 12:14:40,474 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:14:40,474 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:40,474 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:40,474 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:40,474 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:40,657 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:40,668 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:40,842 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:40,853 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:41,320 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:41,501 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 12:14:41,894 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:42,247 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:42,632 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:43,502 WARN L192 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:14:44,428 WARN L192 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:14:44,618 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:44,835 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:45,111 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:45,112 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:45,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:45,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2019-12-07 12:14:45,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764023395] [2019-12-07 12:14:45,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 12:14:45,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 12:14:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:14:45,113 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 24 states. [2019-12-07 12:14:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:45,584 INFO L93 Difference]: Finished difference Result 235 states and 264 transitions. [2019-12-07 12:14:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:14:45,584 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-12-07 12:14:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:45,585 INFO L225 Difference]: With dead ends: 235 [2019-12-07 12:14:45,585 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 12:14:45,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=307, Invalid=1763, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 12:14:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 12:14:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 169. [2019-12-07 12:14:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 12:14:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2019-12-07 12:14:45,589 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 33 [2019-12-07 12:14:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:45,589 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2019-12-07 12:14:45,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 12:14:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2019-12-07 12:14:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:14:45,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:45,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:45,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:45,791 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash -148429954, now seen corresponding path program 3 times [2019-12-07 12:14:45,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:45,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453114316] [2019-12-07 12:14:45,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:14:46,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453114316] [2019-12-07 12:14:46,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144189195] [2019-12-07 12:14:46,072 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:46,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:14:46,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:14:46,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 12:14:46,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:46,388 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:14:46,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753761303] [2019-12-07 12:14:46,644 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 12:14:46,644 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:14:46,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:14:46,644 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:14:46,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:14:46,825 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:46,830 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:47,007 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:47,040 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:14:47,448 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:14:47,691 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-12-07 12:14:48,220 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 12:14:48,537 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 12:14:49,085 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 12:14:49,689 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 12:14:50,648 WARN L192 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 12:14:51,576 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 103 [2019-12-07 12:14:51,807 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 12:14:52,057 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-12-07 12:14:52,367 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-12-07 12:14:52,368 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:14:52,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:14:52,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2019-12-07 12:14:52,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300985972] [2019-12-07 12:14:52,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 12:14:52,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:14:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 12:14:52,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 12:14:52,369 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand 37 states. [2019-12-07 12:14:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:56,823 INFO L93 Difference]: Finished difference Result 537 states and 601 transitions. [2019-12-07 12:14:56,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 12:14:56,823 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-12-07 12:14:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:56,825 INFO L225 Difference]: With dead ends: 537 [2019-12-07 12:14:56,825 INFO L226 Difference]: Without dead ends: 527 [2019-12-07 12:14:56,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 3129 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1063, Invalid=10493, Unknown=0, NotChecked=0, Total=11556 [2019-12-07 12:14:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-12-07 12:14:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 261. [2019-12-07 12:14:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 12:14:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2019-12-07 12:14:56,834 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 36 [2019-12-07 12:14:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2019-12-07 12:14:56,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 12:14:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2019-12-07 12:14:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:14:56,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:56,835 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:14:57,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:57,036 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:14:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1499771716, now seen corresponding path program 4 times [2019-12-07 12:14:57,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:14:57,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466715137] [2019-12-07 12:14:57,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:14:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:14:57,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466715137] [2019-12-07 12:14:57,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972824544] [2019-12-07 12:14:57,470 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:14:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:57,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 12:14:57,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:14:58,086 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:59,958 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 12:15:00,111 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2019-12-07 12:15:00,389 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 182 [2019-12-07 12:15:00,934 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 512 DAG size of output: 295 [2019-12-07 12:15:04,412 WARN L192 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 3914 DAG size of output: 941 [2019-12-07 12:15:06,241 WARN L192 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 2947 DAG size of output: 502 [2019-12-07 12:15:06,425 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-12-07 12:15:07,329 WARN L192 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 479 DAG size of output: 441 [2019-12-07 12:15:07,365 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@483ba2f2 [2019-12-07 12:15:07,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019995302] [2019-12-07 12:15:07,366 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 12:15:07,366 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:15:07,366 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:15:07,366 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:15:07,366 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:15:07,371 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@483ba2f2 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 12:15:07,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:15:07,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-12-07 12:15:07,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373645880] [2019-12-07 12:15:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:15:07,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:15:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:15:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 12:15:07,374 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand 15 states. [2019-12-07 12:15:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 12:15:07,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:07,575 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@483ba2f2 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 12:15:07,581 INFO L168 Benchmark]: Toolchain (without parser) took 137999.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.0 MB). Free memory was 945.1 MB in the beginning and 916.5 MB in the end (delta: 28.7 MB). Peak memory consumption was 288.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:15:07,582 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:15:07,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:15:07,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:15:07,583 INFO L168 Benchmark]: Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:15:07,583 INFO L168 Benchmark]: RCFGBuilder took 350.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:15:07,584 INFO L168 Benchmark]: TraceAbstraction took 137300.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.0 GB in the beginning and 916.5 MB in the end (delta: 124.2 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:15:07,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 350.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 137300.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.0 GB in the beginning and 916.5 MB in the end (delta: 124.2 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@483ba2f2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@483ba2f2: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 12:15:08,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:15:08,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:15:08,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:15:08,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:15:08,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:15:08,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:15:08,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:15:08,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:15:08,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:15:08,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:15:08,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:15:08,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:15:08,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:15:08,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:15:08,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:15:08,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:15:08,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:15:08,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:15:08,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:15:08,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:15:08,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:15:08,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:15:08,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:15:08,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:15:08,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:15:08,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:15:08,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:15:08,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:15:08,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:15:08,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:15:08,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:15:08,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:15:08,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:15:08,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:15:08,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:15:08,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:15:08,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:15:08,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:15:08,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:15:08,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:15:08,977 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 12:15:08,990 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:15:08,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:15:08,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:15:08,991 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:15:08,991 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:15:08,992 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:15:08,992 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:15:08,992 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:15:08,992 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:15:08,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:15:08,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:15:08,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:15:08,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:15:08,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:15:08,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:15:08,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:15:08,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:15:08,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:15:08,995 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:15:08,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:15:08,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:15:08,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:15:08,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:15:08,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:15:08,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:15:08,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:15:08,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:15:08,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:15:08,997 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:15:08,998 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:15:08,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:15:08,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:15:08,998 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2019-12-07 12:15:09,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:15:09,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:15:09,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:15:09,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:15:09,180 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:15:09,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-12-07 12:15:09,218 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/2de834c6c/34ce791c35744df580c183b1971fdd50/FLAG2c06ed0d0 [2019-12-07 12:15:09,729 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:15:09,729 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-12-07 12:15:09,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/2de834c6c/34ce791c35744df580c183b1971fdd50/FLAG2c06ed0d0 [2019-12-07 12:15:10,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/data/2de834c6c/34ce791c35744df580c183b1971fdd50 [2019-12-07 12:15:10,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:15:10,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:15:10,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:15:10,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:15:10,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:15:10,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a752c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10, skipping insertion in model container [2019-12-07 12:15:10,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:15:10,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:15:10,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:15:10,503 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:15:10,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:15:10,564 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:15:10,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10 WrapperNode [2019-12-07 12:15:10,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:15:10,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:15:10,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:15:10,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:15:10,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:15:10,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:15:10,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:15:10,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:15:10,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... [2019-12-07 12:15:10,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:15:10,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:15:10,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:15:10,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:15:10,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:15:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 12:15:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:15:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 12:15:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:15:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:15:10,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:15:10,958 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:15:10,958 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 12:15:10,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:10 BoogieIcfgContainer [2019-12-07 12:15:10,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:15:10,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:15:10,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:15:10,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:15:10,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:15:10" (1/3) ... [2019-12-07 12:15:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78195445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:15:10, skipping insertion in model container [2019-12-07 12:15:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:15:10" (2/3) ... [2019-12-07 12:15:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78195445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:15:10, skipping insertion in model container [2019-12-07 12:15:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:10" (3/3) ... [2019-12-07 12:15:10,963 INFO L109 eAbstractionObserver]: Analyzing ICFG substring-alloca-2.i [2019-12-07 12:15:10,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:15:10,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 12:15:10,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 12:15:10,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:15:10,993 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:15:10,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:15:10,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:15:10,994 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:15:10,994 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:15:10,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:15:10,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:15:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-12-07 12:15:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:15:11,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:11,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:11,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 12:15:11,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:11,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935915151] [2019-12-07 12:15:11,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:11,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:15:11,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:11,097 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:11,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935915151] [2019-12-07 12:15:11,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:11,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:15:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230837266] [2019-12-07 12:15:11,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:15:11,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:15:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:11,135 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 6 states. [2019-12-07 12:15:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:11,239 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2019-12-07 12:15:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:11,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 12:15:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:11,248 INFO L225 Difference]: With dead ends: 96 [2019-12-07 12:15:11,248 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 12:15:11,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 12:15:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-12-07 12:15:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:15:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-12-07 12:15:11,277 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2019-12-07 12:15:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:11,277 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-12-07 12:15:11,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-12-07 12:15:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:15:11,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:11,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:11,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:15:11,479 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 12:15:11,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:11,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393837694] [2019-12-07 12:15:11,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:11,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:15:11,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:11,646 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:11,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 12:15:11,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:11,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:11,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:11,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 12:15:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:11,668 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:11,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393837694] [2019-12-07 12:15:11,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:11,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:15:11,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989574960] [2019-12-07 12:15:11,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:11,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:11,681 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2019-12-07 12:15:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:11,778 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-12-07 12:15:11,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:11,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 12:15:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:11,780 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:15:11,780 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 12:15:11,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 12:15:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 12:15:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 12:15:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-12-07 12:15:11,786 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2019-12-07 12:15:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:11,786 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-12-07 12:15:11,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-12-07 12:15:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:15:11,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:11,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:11,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:15:11,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 12:15:11,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:11,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87079879] [2019-12-07 12:15:11,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:12,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:15:12,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:12,087 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 12:15:12,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:12,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:12,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:12,118 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:12,118 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:12,137 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,137 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 12:15:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:12,155 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:12,269 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:15:12,276 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:12,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:12,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:15:12,286 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:12,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:12,293 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 12:15:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:12,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87079879] [2019-12-07 12:15:12,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:12,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:15:12,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443712414] [2019-12-07 12:15:12,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:15:12,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:12,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:15:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:12,310 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 6 states. [2019-12-07 12:15:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:12,758 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-12-07 12:15:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:12,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 12:15:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:12,760 INFO L225 Difference]: With dead ends: 93 [2019-12-07 12:15:12,760 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 12:15:12,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:15:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 12:15:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 53. [2019-12-07 12:15:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:15:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-12-07 12:15:12,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 7 [2019-12-07 12:15:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:12,765 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-12-07 12:15:12,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-12-07 12:15:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:15:12,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:12,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:12,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:15:12,967 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 12:15:12,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:12,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409449782] [2019-12-07 12:15:12,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:12,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:15:12,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:13,007 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-12-07 12:15:13,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:13,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:13,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:13,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:13,028 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:13,029 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:13,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:13,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:13,040 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:15:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:13,051 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:13,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:13,138 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:15:13,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:13,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:13,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:13,153 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:15:13,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:13,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 12:15:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:13,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409449782] [2019-12-07 12:15:13,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:13,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:15:13,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890780255] [2019-12-07 12:15:13,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:15:13,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:15:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:13,175 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 6 states. [2019-12-07 12:15:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:13,628 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-12-07 12:15:13,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:13,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 12:15:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:13,630 INFO L225 Difference]: With dead ends: 89 [2019-12-07 12:15:13,631 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 12:15:13,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:15:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 12:15:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-12-07 12:15:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 12:15:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-12-07 12:15:13,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 9 [2019-12-07 12:15:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:13,635 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-12-07 12:15:13,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-12-07 12:15:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:15:13,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:13,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:13,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:15:13,837 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 12:15:13,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:13,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150304893] [2019-12-07 12:15:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:13,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:15:13,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:13,877 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:13,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150304893] [2019-12-07 12:15:13,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:13,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:15:13,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192371863] [2019-12-07 12:15:13,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:15:13,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:13,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:15:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:13,901 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 6 states. [2019-12-07 12:15:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:13,984 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2019-12-07 12:15:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:13,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 12:15:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:13,985 INFO L225 Difference]: With dead ends: 94 [2019-12-07 12:15:13,986 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 12:15:13,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 12:15:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-12-07 12:15:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:15:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 12:15:13,990 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 9 [2019-12-07 12:15:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:13,990 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 12:15:13,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 12:15:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:15:13,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:13,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:14,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:15:14,193 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 12:15:14,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:14,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264421967] [2019-12-07 12:15:14,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:14,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:15:14,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:14,278 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:14,279 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:14,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:14,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:14,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:14,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 12:15:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:14,291 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:14,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264421967] [2019-12-07 12:15:14,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:14,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 12:15:14,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307866363] [2019-12-07 12:15:14,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:14,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:14,297 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 3 states. [2019-12-07 12:15:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:14,348 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-12-07 12:15:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:14,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:15:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:14,349 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:15:14,349 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 12:15:14,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 12:15:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 12:15:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:15:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-12-07 12:15:14,352 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 9 [2019-12-07 12:15:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:14,353 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-12-07 12:15:14,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-12-07 12:15:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:15:14,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:14,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:14,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:15:14,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 12:15:14,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:14,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525094191] [2019-12-07 12:15:14,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:14,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:15:14,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:14,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:14,656 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:14,656 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:14,689 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:14,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:14,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 12:15:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:14,717 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:14,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525094191] [2019-12-07 12:15:14,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:14,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 12:15:14,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284453668] [2019-12-07 12:15:14,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:15:14,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:15:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:15:14,861 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 8 states. [2019-12-07 12:15:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:15,235 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-12-07 12:15:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:15,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 12:15:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:15,237 INFO L225 Difference]: With dead ends: 94 [2019-12-07 12:15:15,237 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 12:15:15,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:15:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 12:15:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-12-07 12:15:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:15:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-12-07 12:15:15,241 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 9 [2019-12-07 12:15:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:15,241 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-12-07 12:15:15,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:15:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-12-07 12:15:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:15:15,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:15,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:15,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:15:15,443 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 12:15:15,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:15,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376501862] [2019-12-07 12:15:15,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:15,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:15:15,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:15,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:15,573 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:15,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:15,594 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 12:15:15,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:15,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 12:15:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:15,604 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:15,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376501862] [2019-12-07 12:15:15,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:15,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:15:15,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989957280] [2019-12-07 12:15:15,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:15:15,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:15,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:15:15,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:15:15,696 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 6 states. [2019-12-07 12:15:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:15,937 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2019-12-07 12:15:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:15,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 12:15:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:15,939 INFO L225 Difference]: With dead ends: 91 [2019-12-07 12:15:15,939 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 12:15:15,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:15:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 12:15:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2019-12-07 12:15:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:15:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-12-07 12:15:15,942 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 10 [2019-12-07 12:15:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:15,942 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-12-07 12:15:15,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-12-07 12:15:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:15:15,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:15,943 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:16,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:15:16,144 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 12:15:16,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:16,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819328514] [2019-12-07 12:15:16,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:16,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:15:16,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:16,231 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-12-07 12:15:16,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:16,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:16,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:16,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:16,279 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:16,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:16,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:16,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:16,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:15:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:16,495 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:16,905 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:15:16,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:16,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:16,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:16,910 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:15:16,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:16,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 12:15:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819328514] [2019-12-07 12:15:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1221485059] [2019-12-07 12:15:16,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:15:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:16,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:15:16,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:16,986 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-12-07 12:15:16,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:16,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:16,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:17,010 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:17,010 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:17,024 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,024 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:15:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:17,123 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:17,552 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:15:17,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:17,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:17,556 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:15:17,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:15:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:17,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914632309] [2019-12-07 12:15:17,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:17,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:15:17,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:17,618 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_46|]} [2019-12-07 12:15:17,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:17,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:17,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:17,637 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:17,638 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:17,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:17,648 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:15:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:17,794 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:15:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 12:15:17,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926044755] [2019-12-07 12:15:17,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:15:17,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:15:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:15:17,805 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 19 states. [2019-12-07 12:15:18,430 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 12:15:18,704 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 12:15:19,326 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 12:15:19,987 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 12:15:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:20,623 INFO L93 Difference]: Finished difference Result 238 states and 277 transitions. [2019-12-07 12:15:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:15:20,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 12:15:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:20,626 INFO L225 Difference]: With dead ends: 238 [2019-12-07 12:15:20,626 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 12:15:20,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:15:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 12:15:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 86. [2019-12-07 12:15:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 12:15:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 12:15:20,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 11 [2019-12-07 12:15:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:20,631 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 12:15:20,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:15:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 12:15:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:15:20,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:20,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:21,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:15:21,234 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash -464624129, now seen corresponding path program 1 times [2019-12-07 12:15:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155899548] [2019-12-07 12:15:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:21,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:15:21,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:21,331 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:21,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:21,423 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 12:15:21,423 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:21,434 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 12:15:21,434 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:21,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:21,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 12:15:21,463 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 12:15:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:21,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155899548] [2019-12-07 12:15:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:21,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 12:15:21,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817552900] [2019-12-07 12:15:21,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:15:21,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:15:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:15:21,581 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 10 states. [2019-12-07 12:15:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:22,335 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2019-12-07 12:15:22,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:15:22,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 12:15:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:22,338 INFO L225 Difference]: With dead ends: 172 [2019-12-07 12:15:22,338 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 12:15:22,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:15:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 12:15:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 87. [2019-12-07 12:15:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 12:15:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2019-12-07 12:15:22,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 12 [2019-12-07 12:15:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:22,343 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-12-07 12:15:22,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:15:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2019-12-07 12:15:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:15:22,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:22,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:22,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 12:15:22,545 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2019-12-07 12:15:22,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:22,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252779624] [2019-12-07 12:15:22,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:22,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:15:22,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:22,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:22,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252779624] [2019-12-07 12:15:22,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:22,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:15:22,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699113432] [2019-12-07 12:15:22,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:22,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:22,644 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand 4 states. [2019-12-07 12:15:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:22,718 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-12-07 12:15:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:22,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:15:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:22,719 INFO L225 Difference]: With dead ends: 86 [2019-12-07 12:15:22,719 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 12:15:22,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 12:15:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 12:15:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 12:15:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 12:15:22,722 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 12 [2019-12-07 12:15:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:22,722 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 12:15:22,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 12:15:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:15:22,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:22,723 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:22,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 12:15:22,924 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 12:15:22,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:22,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700294415] [2019-12-07 12:15:22,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:22,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:15:22,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:22,986 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:22,986 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:22,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,026 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:23,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:23,122 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700294415] [2019-12-07 12:15:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194519812] [2019-12-07 12:15:23,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:15:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:23,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:15:23,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:23,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:23,573 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:23,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,606 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:23,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:23,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:23,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581553507] [2019-12-07 12:15:23,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:23,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:15:23,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:23,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:23,668 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:23,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,697 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:23,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:23,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:23,785 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:24,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:15:24,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 12:15:24,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168350361] [2019-12-07 12:15:24,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:15:24,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:24,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:15:24,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:15:24,508 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 17 states. [2019-12-07 12:15:25,418 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 12:15:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:25,910 INFO L93 Difference]: Finished difference Result 147 states and 173 transitions. [2019-12-07 12:15:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:15:25,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 12:15:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:25,911 INFO L225 Difference]: With dead ends: 147 [2019-12-07 12:15:25,911 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 12:15:25,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:15:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 12:15:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 83. [2019-12-07 12:15:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 12:15:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 12:15:25,914 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 13 [2019-12-07 12:15:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:25,914 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 12:15:25,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:15:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 12:15:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:15:25,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:25,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:26,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:26,517 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash 172811107, now seen corresponding path program 1 times [2019-12-07 12:15:26,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:26,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630657366] [2019-12-07 12:15:26,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/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 [2019-12-07 12:15:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:26,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:15:26,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:26,603 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:26,603 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:26,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:26,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:26,607 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:26,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 12:15:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:26,621 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:26,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630657366] [2019-12-07 12:15:26,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:26,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:15:26,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268330575] [2019-12-07 12:15:26,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:15:26,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:26,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:15:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:26,627 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 5 states. [2019-12-07 12:15:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:26,736 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-12-07 12:15:26,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:26,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:15:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:26,737 INFO L225 Difference]: With dead ends: 83 [2019-12-07 12:15:26,737 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 12:15:26,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:15:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 12:15:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-12-07 12:15:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 12:15:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-12-07 12:15:26,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 14 [2019-12-07 12:15:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:26,739 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-12-07 12:15:26,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:15:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-12-07 12:15:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:15:26,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:26,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:26,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 12:15:26,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash 172811108, now seen corresponding path program 1 times [2019-12-07 12:15:26,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:26,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037180366] [2019-12-07 12:15:26,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/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 [2019-12-07 12:15:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:27,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:15:27,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:27,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:27,054 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:27,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:27,072 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:15:27,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:27,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:15:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:27,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:27,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037180366] [2019-12-07 12:15:27,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 12:15:27,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125062204] [2019-12-07 12:15:27,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:15:27,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:15:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:15:27,250 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 10 states. [2019-12-07 12:15:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:27,933 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2019-12-07 12:15:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:15:27,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 12:15:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:27,935 INFO L225 Difference]: With dead ends: 131 [2019-12-07 12:15:27,935 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 12:15:27,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:15:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 12:15:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-12-07 12:15:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 12:15:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2019-12-07 12:15:27,938 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 14 [2019-12-07 12:15:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:27,938 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2019-12-07 12:15:27,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:15:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2019-12-07 12:15:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:15:27,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:27,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:28,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 12:15:28,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1432273078, now seen corresponding path program 1 times [2019-12-07 12:15:28,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:28,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028591750] [2019-12-07 12:15:28,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/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 [2019-12-07 12:15:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:28,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:15:28,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:28,201 INFO L377 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 6 treesize of output 5 [2019-12-07 12:15:28,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:28,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:28,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:28,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:15:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:30,247 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:32,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028591750] [2019-12-07 12:15:32,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:32,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 12:15:32,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214221976] [2019-12-07 12:15:32,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:15:32,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:32,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:15:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=2, NotChecked=0, Total=72 [2019-12-07 12:15:32,339 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 9 states. [2019-12-07 12:15:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:42,524 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-12-07 12:15:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:42,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 12:15:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:42,526 INFO L225 Difference]: With dead ends: 78 [2019-12-07 12:15:42,526 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:15:42,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2019-12-07 12:15:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:15:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 12:15:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 12:15:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-12-07 12:15:42,528 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 16 [2019-12-07 12:15:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:42,528 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-12-07 12:15:42,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:15:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-12-07 12:15:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:15:42,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:42,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:42,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 12:15:42,729 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2001954455, now seen corresponding path program 1 times [2019-12-07 12:15:42,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:42,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067988931] [2019-12-07 12:15:42,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:42,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:15:42,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:42,830 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:42,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067988931] [2019-12-07 12:15:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:42,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:15:42,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544676423] [2019-12-07 12:15:42,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:15:42,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:15:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:42,837 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 5 states. [2019-12-07 12:15:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:42,934 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-12-07 12:15:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:15:42,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 12:15:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:42,936 INFO L225 Difference]: With dead ends: 75 [2019-12-07 12:15:42,936 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:15:42,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:15:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:15:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-12-07 12:15:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:15:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-12-07 12:15:42,937 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2019-12-07 12:15:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:42,938 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-12-07 12:15:42,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:15:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-12-07 12:15:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:15:42,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:42,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:43,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 12:15:43,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2001954454, now seen corresponding path program 1 times [2019-12-07 12:15:43,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:43,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738709793] [2019-12-07 12:15:43,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/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 [2019-12-07 12:15:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:43,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:15:43,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:43,292 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:43,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:43,459 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 12:15:43,459 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:43,472 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 12:15:43,472 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:43,501 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:43,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 12:15:43,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 12:15:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:43,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738709793] [2019-12-07 12:15:43,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:43,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 12:15:43,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938033770] [2019-12-07 12:15:43,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:15:43,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:15:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:15:43,633 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 12 states. [2019-12-07 12:15:44,730 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 12:15:45,071 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 12:15:45,309 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 12:15:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:45,880 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2019-12-07 12:15:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 12:15:45,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-07 12:15:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:45,882 INFO L225 Difference]: With dead ends: 174 [2019-12-07 12:15:45,882 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 12:15:45,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:15:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 12:15:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 78. [2019-12-07 12:15:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 12:15:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2019-12-07 12:15:45,885 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 18 [2019-12-07 12:15:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:45,885 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2019-12-07 12:15:45,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:15:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2019-12-07 12:15:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:15:45,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:45,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:46,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 12:15:46,087 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2001945381, now seen corresponding path program 1 times [2019-12-07 12:15:46,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:46,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277639091] [2019-12-07 12:15:46,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:46,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:15:46,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:46,190 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:46,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277639091] [2019-12-07 12:15:46,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:46,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:15:46,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276163376] [2019-12-07 12:15:46,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:46,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:46,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:46,192 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 3 states. [2019-12-07 12:15:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:46,199 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-12-07 12:15:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:46,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:15:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:46,200 INFO L225 Difference]: With dead ends: 79 [2019-12-07 12:15:46,200 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 12:15:46,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 12:15:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 12:15:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 12:15:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2019-12-07 12:15:46,202 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 18 [2019-12-07 12:15:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:46,203 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2019-12-07 12:15:46,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2019-12-07 12:15:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:15:46,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:46,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:46,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 12:15:46,404 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 275803338, now seen corresponding path program 1 times [2019-12-07 12:15:46,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:46,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667882807] [2019-12-07 12:15:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/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 [2019-12-07 12:15:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:46,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:15:46,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:46,546 INFO L377 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 18 treesize of output 10 [2019-12-07 12:15:46,547 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:46,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:46,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:46,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2019-12-07 12:15:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:46,567 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:46,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667882807] [2019-12-07 12:15:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-12-07 12:15:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40136839] [2019-12-07 12:15:46,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:15:46,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:15:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:15:46,614 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 9 states. [2019-12-07 12:15:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:46,784 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-12-07 12:15:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:15:46,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 12:15:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:46,786 INFO L225 Difference]: With dead ends: 81 [2019-12-07 12:15:46,786 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 12:15:46,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:15:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 12:15:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 12:15:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 12:15:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-12-07 12:15:46,788 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 20 [2019-12-07 12:15:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:46,788 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-12-07 12:15:46,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:15:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-12-07 12:15:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:15:46,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:46,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:46,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 12:15:46,990 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash -309239812, now seen corresponding path program 1 times [2019-12-07 12:15:46,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:46,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001217048] [2019-12-07 12:15:46,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:47,062 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 12:15:47,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:47,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 8 [2019-12-07 12:15:47,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 12:15:47,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 12:15:47,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 12:15:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:47,148 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:15:47,196 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:15:47,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,199 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:6 [2019-12-07 12:15:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:47,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001217048] [2019-12-07 12:15:47,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:47,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 12 [2019-12-07 12:15:47,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618434893] [2019-12-07 12:15:47,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:15:47,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:15:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:15:47,204 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 12 states. [2019-12-07 12:15:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:47,420 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-12-07 12:15:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:15:47,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 12:15:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:47,421 INFO L225 Difference]: With dead ends: 87 [2019-12-07 12:15:47,421 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:15:47,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:15:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:15:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-12-07 12:15:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:15:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-12-07 12:15:47,423 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 21 [2019-12-07 12:15:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:47,423 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-12-07 12:15:47,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:15:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-12-07 12:15:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:15:47,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:47,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:47,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 12:15:47,625 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1991582778, now seen corresponding path program 1 times [2019-12-07 12:15:47,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:47,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054542771] [2019-12-07 12:15:47,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:47,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 12:15:47,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:47,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,736 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:47,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,761 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:47,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:47,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:15:47,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:47,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 12:15:47,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 12:15:47,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,896 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:47,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:47,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:47,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:27 [2019-12-07 12:15:47,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:47,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:48,281 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:48,973 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:48,990 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:48,991 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:48,996 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:48,996 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,002 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:49,020 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:49,021 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:49,025 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:49,025 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:49,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:15:49,046 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:29 [2019-12-07 12:15:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:49,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054542771] [2019-12-07 12:15:49,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661976992] [2019-12-07 12:15:49,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:15:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:49,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:15:49,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:49,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:49,410 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:49,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,438 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:49,439 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,439 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:49,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:15:49,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,478 INFO L614 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-12-07 12:15:49,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:23 [2019-12-07 12:15:49,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:49,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 12:15:49,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:49,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:49,966 INFO L614 ElimStorePlain]: treesize reduction 8, result has 69.2 percent of original size [2019-12-07 12:15:49,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:49,967 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-12-07 12:15:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:49,969 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:49,984 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:50,010 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:50,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:50,015 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:50,015 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,027 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:50,056 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:50,058 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:50,061 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:50,061 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:50,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:15:50,134 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:47 [2019-12-07 12:15:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:50,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011108821] [2019-12-07 12:15:50,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:50,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 12:15:50,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:50,493 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:15:50,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:50,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 12:15:50,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-12-07 12:15:50,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:50,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 12:15:50,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-12-07 12:15:50,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:50,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:50,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-12-07 12:15:50,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2019-12-07 12:15:50,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:50,925 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:50,925 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-12-07 12:15:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:15:50,997 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:51,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:15:51,408 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:15:51,409 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:51,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:51,410 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:51,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:51,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:51,411 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-12-07 12:15:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:15:51,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 12:15:51,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [11, 10, 11, 9] total 33 [2019-12-07 12:15:51,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117797750] [2019-12-07 12:15:51,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:15:51,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:51,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:15:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 12:15:51,415 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 10 states. [2019-12-07 12:15:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:52,162 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-12-07 12:15:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:15:52,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 12:15:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:52,163 INFO L225 Difference]: With dead ends: 84 [2019-12-07 12:15:52,163 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 12:15:52,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 12:15:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 12:15:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 12:15:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:15:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-12-07 12:15:52,165 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 21 [2019-12-07 12:15:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:52,165 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-12-07 12:15:52,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:15:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-12-07 12:15:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:15:52,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:52,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:52,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2019-12-07 12:15:52,767 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:15:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash 302639036, now seen corresponding path program 1 times [2019-12-07 12:15:52,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:52,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740630928] [2019-12-07 12:15:52,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 12:15:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:52,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 12:15:52,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:52,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:52,864 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:52,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:52,892 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:52,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:52,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:52,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:15:52,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:52,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:52,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:52,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 12:15:53,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:53,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 12:15:53,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,012 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:53,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:53,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:27 [2019-12-07 12:15:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:53,393 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:53,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:54,041 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:54,056 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:54,057 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:54,061 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:54,061 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,072 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:54,093 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:54,094 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:54,098 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:54,098 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:54,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:15:54,122 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:29 [2019-12-07 12:15:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740630928] [2019-12-07 12:15:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [410703405] [2019-12-07 12:15:54,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:15:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:54,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:15:54,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:54,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:54,429 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:54,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,457 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:54,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:54,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:15:54,465 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,496 INFO L614 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-12-07 12:15:54,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:54,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:23 [2019-12-07 12:15:54,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:54,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 12:15:54,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:54,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,011 INFO L614 ElimStorePlain]: treesize reduction 8, result has 69.2 percent of original size [2019-12-07 12:15:55,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-12-07 12:15:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:55,014 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,025 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:55,046 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:55,048 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,051 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:55,051 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,068 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:55,107 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:55,108 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,112 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:55,112 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:55,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,185 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:47 [2019-12-07 12:15:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:55,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279711208] [2019-12-07 12:15:55,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:15:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:55,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:15:55,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:55,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:55,549 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:55,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,577 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:15:55,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,578 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:15:55,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:15:55,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,617 INFO L614 ElimStorePlain]: treesize reduction 21, result has 52.3 percent of original size [2019-12-07 12:15:55,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,618 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:23 [2019-12-07 12:15:55,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:55,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 12:15:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,631 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:55,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:55,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:27 [2019-12-07 12:15:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:55,683 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:55,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:55,697 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:55,722 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:55,723 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,727 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:55,727 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,739 INFO L377 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 16 treesize of output 14 [2019-12-07 12:15:55,774 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:15:55,776 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,781 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:15:55,781 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:55,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:55,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:15:55,863 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:83, output treesize:63 [2019-12-07 12:15:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:15:56,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:15:56,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11, 9, 10, 9] total 24 [2019-12-07 12:15:56,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223554489] [2019-12-07 12:15:56,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 12:15:56,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 12:15:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:15:56,152 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 25 states. [2019-12-07 12:15:56,959 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 12:15:57,119 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 12:15:57,439 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-07 12:15:57,618 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-12-07 12:15:57,794 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 12:15:57,998 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 12:15:58,207 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-12-07 12:15:58,471 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 12:15:58,730 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 12:15:58,948 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 12:15:59,943 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 12:16:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:00,165 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2019-12-07 12:16:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:16:00,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-12-07 12:16:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:00,167 INFO L225 Difference]: With dead ends: 93 [2019-12-07 12:16:00,167 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 12:16:00,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 12:16:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 12:16:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-12-07 12:16:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 12:16:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-12-07 12:16:00,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2019-12-07 12:16:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:00,170 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-12-07 12:16:00,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 12:16:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-12-07 12:16:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:16:00,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:00,170 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 12:16:00,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:00,772 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:16:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2019-12-07 12:16:00,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:16:00,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144942776] [2019-12-07 12:16:00,774 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 12:16:00,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:16:00,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:16:00,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:16:00,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:00,827 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_64|], 1=[|v_#valid_69|]} [2019-12-07 12:16:00,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:00,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:16:00,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:00,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:00,854 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:16:00,854 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:00,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:00,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:00,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:16:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:01,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:02,143 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:16:02,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:02,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:02,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:02,149 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:16:02,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:02,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:16:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:02,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144942776] [2019-12-07 12:16:02,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1468870606] [2019-12-07 12:16:02,152 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:16:02,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:16:02,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:16:02,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:16:02,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:02,245 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_66|], 1=[|v_#valid_71|]} [2019-12-07 12:16:02,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:02,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:16:02,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:02,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:02,269 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:16:02,270 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:02,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:02,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:02,285 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:16:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:02,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:04,574 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:16:04,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:04,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:04,580 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:16:04,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2019-12-07 12:16:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:04,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685358831] [2019-12-07 12:16:04,582 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:04,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:16:04,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:16:04,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:16:04,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:04,626 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_68|], 1=[|v_#valid_73|]} [2019-12-07 12:16:04,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:04,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:16:04,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:04,652 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:16:04,653 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:04,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,667 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:16:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:04,740 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:04,745 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:16:04,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:16:04,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:04,749 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:16:04,750 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:04,750 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:16:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:04,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:16:04,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 8, 8] total 29 [2019-12-07 12:16:04,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577738127] [2019-12-07 12:16:04,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:16:04,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:16:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:16:04,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:16:04,753 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 30 states. [2019-12-07 12:16:07,945 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 12:16:09,531 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 12:16:12,883 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 12:16:14,318 WARN L192 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 12:16:16,150 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-07 12:16:19,205 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 12:16:19,985 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 12:16:21,353 WARN L192 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 12:16:24,029 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 12:16:24,541 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 12:16:25,403 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 12:16:26,989 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 12:16:28,121 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 12:16:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:29,506 INFO L93 Difference]: Finished difference Result 509 states and 577 transitions. [2019-12-07 12:16:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:16:29,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-12-07 12:16:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:29,510 INFO L225 Difference]: With dead ends: 509 [2019-12-07 12:16:29,510 INFO L226 Difference]: Without dead ends: 509 [2019-12-07 12:16:29,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=665, Invalid=1785, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 12:16:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-12-07 12:16:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 129. [2019-12-07 12:16:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 12:16:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2019-12-07 12:16:29,515 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 23 [2019-12-07 12:16:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:29,515 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2019-12-07 12:16:29,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:16:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2019-12-07 12:16:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:16:29,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:29,516 INFO L410 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] [2019-12-07 12:16:30,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:16:30,119 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:16:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1221696661, now seen corresponding path program 1 times [2019-12-07 12:16:30,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:16:30,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893770524] [2019-12-07 12:16:30,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 12:16:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:30,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:16:30,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:30,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-12-07 12:16:30,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:30,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:30,273 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-12-07 12:16:30,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:16:30,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:30,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2019-12-07 12:16:30,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:30,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-12-07 12:16:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:30,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:30,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:30,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:16:30,509 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:16:30,509 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:30,511 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:30,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:30,512 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:6 [2019-12-07 12:16:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:30,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893770524] [2019-12-07 12:16:30,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:16:30,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 17 [2019-12-07 12:16:30,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099068967] [2019-12-07 12:16:30,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:16:30,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:16:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:16:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:16:30,615 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 17 states. [2019-12-07 12:16:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:16:31,390 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2019-12-07 12:16:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:16:31,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-12-07 12:16:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:16:31,391 INFO L225 Difference]: With dead ends: 142 [2019-12-07 12:16:31,391 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 12:16:31,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:16:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 12:16:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-12-07 12:16:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 12:16:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2019-12-07 12:16:31,393 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 23 [2019-12-07 12:16:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:16:31,394 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2019-12-07 12:16:31,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:16:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2019-12-07 12:16:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:16:31,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:16:31,394 INFO L410 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] [2019-12-07 12:16:31,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 12:16:31,595 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:16:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:16:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1827161362, now seen corresponding path program 1 times [2019-12-07 12:16:31,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:16:31,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064720579] [2019-12-07 12:16:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 12:16:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:31,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 12:16:31,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:31,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:31,741 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:16:31,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,778 INFO L614 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2019-12-07 12:16:31,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2019-12-07 12:16:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-12-07 12:16:31,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-12-07 12:16:31,825 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:31,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:16:31,883 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-12-07 12:16:31,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:32,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:32,031 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 80 [2019-12-07 12:16:32,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:32,217 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-07 12:16:32,217 INFO L614 ElimStorePlain]: treesize reduction 50, result has 62.1 percent of original size [2019-12-07 12:16:32,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:32,261 INFO L377 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 1 case distinctions, treesize of input 29 treesize of output 64 [2019-12-07 12:16:32,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:49,076 WARN L192 SmtUtils]: Spent 16.82 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 12:16:49,077 INFO L614 ElimStorePlain]: treesize reduction 13, result has 88.6 percent of original size [2019-12-07 12:16:49,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:49,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:16:49,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:101 [2019-12-07 12:16:49,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:49,240 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 12:16:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:49,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:49,928 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 12:16:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,142 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 12:16:50,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:50,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 61 [2019-12-07 12:16:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,200 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:50,584 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-12-07 12:16:50,585 INFO L614 ElimStorePlain]: treesize reduction 10, result has 90.8 percent of original size [2019-12-07 12:16:50,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:50,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 110 [2019-12-07 12:16:50,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:50,679 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:50,822 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 12:16:50,822 INFO L614 ElimStorePlain]: treesize reduction 40, result has 69.7 percent of original size [2019-12-07 12:16:50,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 12:16:50,824 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:92 [2019-12-07 12:16:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:50,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:16:51,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,273 WARN L192 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 12:16:59,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:59,274 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 265 treesize of output 253 [2019-12-07 12:16:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:59,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 169 [2019-12-07 12:16:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:59,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:16:59,506 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_69], 1=[v_arrayElimCell_70]} [2019-12-07 12:16:59,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064720579] [2019-12-07 12:16:59,521 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2ca118e6 [2019-12-07 12:16:59,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1960802392] [2019-12-07 12:16:59,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:16:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:59,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:16:59,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:59,651 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2ca118e6 [2019-12-07 12:16:59,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432203854] [2019-12-07 12:16:59,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73bad755-4f8a-4d0d-b0bf-41c9c7bc5a7c/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:16:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:59,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 12:16:59,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:59,698 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2ca118e6 [2019-12-07 12:16:59,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:16:59,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 12:16:59,699 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 12:16:59,699 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:17:00,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 cvc4 --incremental --print-success --lang smt --rewrite-divk,36 mathsat -unsat_core_generation=3 [2019-12-07 12:17:00,320 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 12:17:00,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:17:00 BoogieIcfgContainer [2019-12-07 12:17:00,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:17:00,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:17:00,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:17:00,320 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:17:00,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:15:10" (3/4) ... [2019-12-07 12:17:00,324 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:17:00,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:17:00,325 INFO L168 Benchmark]: Toolchain (without parser) took 110071.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:17:00,325 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:17:00,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:17:00,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:17:00,326 INFO L168 Benchmark]: Boogie Preprocessor took 21.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:17:00,327 INFO L168 Benchmark]: RCFGBuilder took 335.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:17:00,327 INFO L168 Benchmark]: TraceAbstraction took 109360.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:17:00,327 INFO L168 Benchmark]: Witness Printer took 3.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:17:00,329 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 335.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109360.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 517]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L530] int length1 = __VERIFIER_nondet_int(); [L531] int length2 = __VERIFIER_nondet_int(); [L532] COND FALSE !(length1 < 1) [L535] COND FALSE !(length2 < 1) [L538] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L539] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L541] int i = 0; [L541] COND FALSE !(i < length1 - 1) [L547] int i = 0; [L547] COND TRUE i < length2 - 1 [L549] nondetString2[i] = __VERIFIER_nondet_char() [L547] i++ [L547] COND FALSE !(i < length2 - 1) [L552] nondetString1[length1-1] = '\0' [L553] nondetString2[length2-1] = '\0' [L516] char *ps = s; [L517] EXPR \read(*ps) [L517] COND TRUE *ps != '\0' [L518] char *ps2 = ps; [L519] char *pt = t; [L520] EXPR \read(*pt) [L520] *pt != '\0' && *pt == *ps2 [L520] EXPR \read(*pt) [L520] EXPR \read(*ps2) [L520] *pt != '\0' && *pt == *ps2 [L520] COND FALSE !(*pt != '\0' && *pt == *ps2) [L524] EXPR \read(*pt) [L524] COND FALSE !(*pt == '\0') [L525] ps++ [L517] \read(*ps) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 19 error locations. Result: UNKNOWN, OverallTime: 109.3s, OverallIterations: 25, TraceHistogramMax: 5, AutomataDifference: 50.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 832 SDtfs, 6932 SDslu, 2993 SDs, 0 SdLazy, 3068 SolverSat, 289 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1081 GetRequests, 729 SyntacticMatches, 26 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 972 ConstructedInterpolants, 28 QuantifiedInterpolants, 202826 SizeOfPredicates, 310 NumberOfNonLiveVariables, 1890 ConjunctsInSsa, 357 ConjunctsInUnsatCore, 68 InterpolantComputations, 40 PerfectInterpolantSequences, 10/236 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...