./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-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_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:44:24,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:44:24,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:44:24,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:44:24,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:44:24,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:44:24,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:44:24,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:44:24,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:44:24,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:44:24,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:44:24,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:44:24,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:44:24,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:44:24,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:44:24,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:44:24,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:44:24,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:44:24,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:44:24,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:44:24,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:44:24,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:44:24,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:44:24,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:44:24,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:44:24,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:44:24,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:44:24,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:44:24,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:44:24,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:44:24,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:44:24,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:44:24,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:44:24,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:44:24,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:44:24,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:44:24,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:44:24,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:44:24,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:44:24,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:44:24,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:44:24,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:44:24,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:44:24,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:44:24,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:44:24,109 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:44:24,110 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:44:24,110 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:44:24,111 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:44:24,111 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:44:24,111 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:44:24,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:44:24,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:44:24,112 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:44:24,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:44:24,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:44:24,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:44:24,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:44:24,114 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:44:24,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:44:24,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:44:24,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:44:24,114 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_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 -> 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc [2019-12-07 20:44:24,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:44:24,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:44:24,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:44:24,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:44:24,237 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:44:24,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-12-07 20:44:24,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/5d56112c1/f85eb4071d07469a98317afdff2ec211/FLAG0c1fb8e3c [2019-12-07 20:44:24,731 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:44:24,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-12-07 20:44:24,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/5d56112c1/f85eb4071d07469a98317afdff2ec211/FLAG0c1fb8e3c [2019-12-07 20:44:24,749 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/5d56112c1/f85eb4071d07469a98317afdff2ec211 [2019-12-07 20:44:24,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:44:24,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:44:24,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:24,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:44:24,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:44:24,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:24" (1/1) ... [2019-12-07 20:44:24,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9b903f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:24, skipping insertion in model container [2019-12-07 20:44:24,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:24" (1/1) ... [2019-12-07 20:44:24,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:44:24,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:44:25,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:25,022 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:44:25,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:25,090 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:44:25,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25 WrapperNode [2019-12-07 20:44:25,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:25,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:25,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:44:25,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:44:25,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:25,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:44:25,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:44:25,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:44:25,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... [2019-12-07 20:44:25,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:44:25,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:44:25,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:44:25,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:44:25,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:44:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:44:25,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:44:25,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:44:25,456 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 20:44:25,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:25 BoogieIcfgContainer [2019-12-07 20:44:25,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:44:25,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:44:25,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:44:25,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:44:25,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:44:24" (1/3) ... [2019-12-07 20:44:25,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e8c2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:25, skipping insertion in model container [2019-12-07 20:44:25,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:25" (2/3) ... [2019-12-07 20:44:25,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e8c2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:25, skipping insertion in model container [2019-12-07 20:44:25,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:25" (3/3) ... [2019-12-07 20:44:25,462 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2019-12-07 20:44:25,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:44:25,473 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-12-07 20:44:25,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-12-07 20:44:25,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:44:25,492 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:44:25,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:44:25,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:44:25,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:44:25,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:44:25,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:44:25,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:44:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-12-07 20:44:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:44:25,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:44:25,509 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 142487, now seen corresponding path program 1 times [2019-12-07 20:44:25,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789734953] [2019-12-07 20:44:25,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:25,613 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 20:44:25,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789734953] [2019-12-07 20:44:25,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:25,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:44:25,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757411187] [2019-12-07 20:44:25,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:25,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:25,628 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-12-07 20:44:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:25,682 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-12-07 20:44:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:25,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:44:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:25,689 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:44:25,689 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 20:44:25,690 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 20:44:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 20:44:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-12-07 20:44:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 20:44:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 20:44:25,713 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 3 [2019-12-07 20:44:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:25,713 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 20:44:25,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 20:44:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:44:25,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:44:25,714 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 142488, now seen corresponding path program 1 times [2019-12-07 20:44:25,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131191320] [2019-12-07 20:44:25,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:25,747 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 20:44:25,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131191320] [2019-12-07 20:44:25,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:25,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:44:25,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004213401] [2019-12-07 20:44:25,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:25,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:25,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:25,749 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 3 states. [2019-12-07 20:44:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:25,778 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 20:44:25,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:25,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:44:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:25,779 INFO L225 Difference]: With dead ends: 44 [2019-12-07 20:44:25,779 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 20:44:25,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 20:44:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 20:44:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 20:44:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 20:44:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 20:44:25,784 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 3 [2019-12-07 20:44:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:25,784 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 20:44:25,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 20:44:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:44:25,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:25,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1551632612, now seen corresponding path program 1 times [2019-12-07 20:44:25,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506241098] [2019-12-07 20:44:25,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:25,821 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 20:44:25,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506241098] [2019-12-07 20:44:25,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:25,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:25,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662299820] [2019-12-07 20:44:25,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:25,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:25,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:25,823 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 3 states. [2019-12-07 20:44:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:25,868 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-12-07 20:44:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:25,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:44:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:25,869 INFO L225 Difference]: With dead ends: 71 [2019-12-07 20:44:25,869 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 20:44:25,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:44:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 20:44:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-12-07 20:44:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 20:44:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 20:44:25,873 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 7 [2019-12-07 20:44:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:25,873 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 20:44:25,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 20:44:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:44:25,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:25,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1551632611, now seen corresponding path program 1 times [2019-12-07 20:44:25,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455362159] [2019-12-07 20:44:25,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:25,912 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 20:44:25,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455362159] [2019-12-07 20:44:25,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:25,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:25,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603799666] [2019-12-07 20:44:25,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:25,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:25,913 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2019-12-07 20:44:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:25,947 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 20:44:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:25,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:44:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:25,948 INFO L225 Difference]: With dead ends: 73 [2019-12-07 20:44:25,948 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 20:44:25,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:44:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 20:44:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 40. [2019-12-07 20:44:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 20:44:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 20:44:25,952 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 7 [2019-12-07 20:44:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 20:44:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 20:44:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:44:25,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:25,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1551533641, now seen corresponding path program 1 times [2019-12-07 20:44:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945694517] [2019-12-07 20:44:25,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:25,974 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 20:44:25,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945694517] [2019-12-07 20:44:25,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:25,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:25,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319919365] [2019-12-07 20:44:25,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:25,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:25,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:25,975 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2019-12-07 20:44:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:25,982 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 20:44:25,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:25,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:44:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:25,983 INFO L225 Difference]: With dead ends: 44 [2019-12-07 20:44:25,983 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 20:44:25,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:44:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 20:44:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-12-07 20:44:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 20:44:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 20:44:25,986 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2019-12-07 20:44:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:25,986 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 20:44:25,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 20:44:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:44:25,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:25,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:25,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash -999988614, now seen corresponding path program 1 times [2019-12-07 20:44:25,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:25,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707373837] [2019-12-07 20:44:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:26,025 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 20:44:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707373837] [2019-12-07 20:44:26,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:26,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:44:26,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680809570] [2019-12-07 20:44:26,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:44:26,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:44:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:44:26,026 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2019-12-07 20:44:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:26,096 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 20:44:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:44:26,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 20:44:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:26,097 INFO L225 Difference]: With dead ends: 52 [2019-12-07 20:44:26,097 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 20:44:26,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 20:44:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 20:44:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2019-12-07 20:44:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 20:44:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 20:44:26,100 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 11 [2019-12-07 20:44:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:26,100 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 20:44:26,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:44:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 20:44:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:44:26,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:26,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:26,101 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash -999988613, now seen corresponding path program 1 times [2019-12-07 20:44:26,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:26,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144104005] [2019-12-07 20:44:26,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:26,129 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 20:44:26,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144104005] [2019-12-07 20:44:26,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217108871] [2019-12-07 20:44:26,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:26,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:44:26,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:26,181 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 20:44:26,181 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:26,192 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 20:44:26,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76525689] [2019-12-07 20:44:26,209 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:44:26,209 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:44:26,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:44:26,217 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:44:26,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:44:26,309 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:26,456 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:26,630 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,260 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,272 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,284 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,384 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,393 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,707 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,775 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,783 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,791 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:27,883 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:44:28,140 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-12-07 20:44:28,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:44:28,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 13 [2019-12-07 20:44:28,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720594796] [2019-12-07 20:44:28,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:44:28,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:44:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:44:28,437 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2019-12-07 20:44:28,615 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-12-07 20:44:28,771 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 20:44:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:29,037 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-12-07 20:44:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:44:29,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-12-07 20:44:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:29,038 INFO L225 Difference]: With dead ends: 42 [2019-12-07 20:44:29,038 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 20:44:29,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:44:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 20:44:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-12-07 20:44:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 20:44:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 20:44:29,041 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2019-12-07 20:44:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:29,041 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 20:44:29,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:44:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 20:44:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:44:29,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:29,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:29,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:29,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1083617165, now seen corresponding path program 1 times [2019-12-07 20:44:29,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:29,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269411297] [2019-12-07 20:44:29,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:29,274 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 20:44:29,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269411297] [2019-12-07 20:44:29,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557715536] [2019-12-07 20:44:29,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:29,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:44:29,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:29,313 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 20:44:29,313 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:29,320 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 20:44:29,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854951464] [2019-12-07 20:44:29,321 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 20:44:29,321 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:44:29,322 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:44:29,322 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:44:29,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:44:29,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:29,446 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:29,780 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:29,790 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:29,807 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:29,923 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:44:30,288 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 20:44:30,937 WARN L192 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2019-12-07 20:44:31,085 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-12-07 20:44:31,277 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-07 20:44:31,781 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 20:44:32,246 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-12-07 20:44:32,492 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 20:44:32,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:44:32,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [3, 3, 3] total 14 [2019-12-07 20:44:32,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663178181] [2019-12-07 20:44:32,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:44:32,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:44:32,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:44:32,494 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 11 states. [2019-12-07 20:44:32,679 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-12-07 20:44:32,968 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2019-12-07 20:44:33,158 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-07 20:44:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:33,444 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-12-07 20:44:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:44:33,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-12-07 20:44:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:33,445 INFO L225 Difference]: With dead ends: 62 [2019-12-07 20:44:33,445 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 20:44:33,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:44:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 20:44:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2019-12-07 20:44:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 20:44:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 20:44:33,449 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2019-12-07 20:44:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:33,449 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 20:44:33,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:44:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 20:44:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:44:33,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:33,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:33,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:33,651 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1065269706, now seen corresponding path program 1 times [2019-12-07 20:44:33,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:33,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356092528] [2019-12-07 20:44:33,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:33,682 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 20:44:33,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356092528] [2019-12-07 20:44:33,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622088562] [2019-12-07 20:44:33,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:33,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:44:33,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:33,720 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 20:44:33,720 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:33,732 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 20:44:33,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1146142958] [2019-12-07 20:44:33,734 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:44:33,734 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:44:33,734 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:44:33,734 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:44:33,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:44:33,768 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:33,843 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:34,150 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:34,159 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:34,167 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:34,539 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:44:34,977 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 20:44:35,558 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 20:44:36,062 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 20:44:36,345 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:44:36,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:44:36,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-12-07 20:44:36,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201414278] [2019-12-07 20:44:36,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:44:36,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:44:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:44:36,346 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2019-12-07 20:44:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:36,368 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-12-07 20:44:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:44:36,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 20:44:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:36,368 INFO L225 Difference]: With dead ends: 53 [2019-12-07 20:44:36,368 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 20:44:36,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:44:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 20:44:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 20:44:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 20:44:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 20:44:36,371 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 16 [2019-12-07 20:44:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:36,372 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 20:44:36,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:44:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 20:44:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:44:36,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:36,372 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:36,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:36,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1591017951, now seen corresponding path program 2 times [2019-12-07 20:44:36,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:36,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061058893] [2019-12-07 20:44:36,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:44:36,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061058893] [2019-12-07 20:44:36,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89434006] [2019-12-07 20:44:36,742 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:36,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:44:36,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:44:36,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 20:44:36,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 20:44:37,118 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 20:44:37,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111907194] [2019-12-07 20:44:37,275 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:44:37,275 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:44:37,275 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:44:37,276 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:44:37,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:44:37,304 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:37,388 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:37,734 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:37,757 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:37,766 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:44:38,147 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:44:38,401 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 20:44:38,901 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 20:44:39,356 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 107 [2019-12-07 20:44:39,898 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 20:44:40,070 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-12-07 20:44:40,289 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 20:44:40,397 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:44:40,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:44:40,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2019-12-07 20:44:40,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183195667] [2019-12-07 20:44:40,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:44:40,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:44:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:44:40,399 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 21 states. [2019-12-07 20:44:41,184 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 20:44:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:41,883 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-12-07 20:44:41,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:44:41,884 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-12-07 20:44:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:41,885 INFO L225 Difference]: With dead ends: 87 [2019-12-07 20:44:41,885 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 20:44:41,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=327, Invalid=1479, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 20:44:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 20:44:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2019-12-07 20:44:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 20:44:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 20:44:41,893 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 28 [2019-12-07 20:44:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:41,893 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 20:44:41,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:44:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 20:44:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:44:41,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:41,895 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:42,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:42,096 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:44:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1591017950, now seen corresponding path program 1 times [2019-12-07 20:44:42,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:42,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672714790] [2019-12-07 20:44:42,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:44:42,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672714790] [2019-12-07 20:44:42,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638201870] [2019-12-07 20:44:42,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:44:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:42,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 20:44:42,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:44:43,155 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:02,300 WARN L192 SmtUtils]: Spent 16.07 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-12-07 20:45:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:45:02,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1433657788] [2019-12-07 20:45:02,374 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:45:02,374 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:45:02,375 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:45:02,375 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:45:02,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:45:02,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:45:02,483 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:45:02,797 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:45:02,806 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:45:02,829 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:45:03,195 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:45:03,873 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-12-07 20:45:04,341 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 107 [2019-12-07 20:45:04,884 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 68 [2019-12-07 20:45:05,220 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 20:45:05,337 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:45:05,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:45:05,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2019-12-07 20:45:05,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994044302] [2019-12-07 20:45:05,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 20:45:05,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:45:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 20:45:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1490, Unknown=1, NotChecked=0, Total=1722 [2019-12-07 20:45:05,339 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 31 states. [2019-12-07 20:45:06,310 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-12-07 20:45:06,508 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-07 20:45:06,679 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-12-07 20:45:07,091 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-07 20:45:07,483 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-07 20:45:07,751 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-12-07 20:45:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:08,169 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-12-07 20:45:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:45:08,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 28 [2019-12-07 20:45:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:08,170 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:45:08,170 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:45:08,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=691, Invalid=2848, Unknown=1, NotChecked=0, Total=3540 [2019-12-07 20:45:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:45:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2019-12-07 20:45:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 20:45:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 20:45:08,175 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2019-12-07 20:45:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:08,175 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 20:45:08,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 20:45:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 20:45:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:45:08,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:08,176 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:08,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:08,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash 40107380, now seen corresponding path program 1 times [2019-12-07 20:45:08,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:45:08,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671532217] [2019-12-07 20:45:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:45:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:45:08,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671532217] [2019-12-07 20:45:08,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296973748] [2019-12-07 20:45:08,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:08,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 20:45:08,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:09,974 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-07 20:45:10,385 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-07 20:45:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:45:10,639 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:11,257 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@66a349c4 [2019-12-07 20:45:11,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564397239] [2019-12-07 20:45:11,258 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 20:45:11,258 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:45:11,258 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:45:11,258 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:45:11,258 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:45:11,264 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@66a349c4 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 20:45:11,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:45:11,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-12-07 20:45:11,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814510679] [2019-12-07 20:45:11,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:45:11,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:45:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:45:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 20:45:11,266 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2019-12-07 20:45:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:45:11,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:11,467 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@66a349c4 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 20:45:11,471 INFO L168 Benchmark]: Toolchain (without parser) took 46718.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 934.6 MB in the beginning and 886.0 MB in the end (delta: 48.6 MB). Peak memory consumption was 351.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:11,471 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:45:11,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:11,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.64 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 20:45:11,472 INFO L168 Benchmark]: Boogie Preprocessor took 21.92 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 20:45:11,473 INFO L168 Benchmark]: RCFGBuilder took 313.19 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 20:45:11,473 INFO L168 Benchmark]: TraceAbstraction took 46012.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 207.1 MB). Free memory was 1.0 GB in the beginning and 886.0 MB in the end (delta: 143.6 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:11,476 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 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.64 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 21.92 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 313.19 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 46012.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 207.1 MB). Free memory was 1.0 GB in the beginning and 886.0 MB in the end (delta: 143.6 MB). Peak memory consumption was 350.7 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@66a349c4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@66a349c4: 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 20:45:12,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:45:12,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:45:12,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:45:12,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:45:12,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:45:12,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:45:12,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:45:12,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:45:12,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:45:12,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:45:12,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:45:12,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:45:12,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:45:12,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:45:12,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:45:12,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:45:12,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:45:12,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:45:12,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:45:12,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:45:12,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:45:12,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:45:12,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:45:12,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:45:12,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:45:12,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:45:12,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:45:12,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:45:12,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:45:12,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:45:12,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:45:12,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:45:12,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:45:12,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:45:12,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:45:12,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:45:12,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:45:12,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:45:12,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:45:12,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:45:12,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 20:45:12,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:45:12,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:45:12,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:45:12,812 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:45:12,812 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:45:12,812 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:45:12,813 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:45:12,813 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:45:12,813 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:45:12,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:45:12,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:45:12,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:45:12,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:45:12,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:45:12,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:45:12,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:45:12,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:45:12,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:45:12,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:45:12,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:45:12,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:45:12,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:45:12,817 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:45:12,817 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:45:12,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:45:12,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:45:12,817 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_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 -> 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc [2019-12-07 20:45:12,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:45:13,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:45:13,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:45:13,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:45:13,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:45:13,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-12-07 20:45:13,053 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/2e6c4214c/f091a8e1fd4f4eb6887fcc0b9167b0dd/FLAGf64c69e28 [2019-12-07 20:45:13,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:45:13,424 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-12-07 20:45:13,437 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/2e6c4214c/f091a8e1fd4f4eb6887fcc0b9167b0dd/FLAGf64c69e28 [2019-12-07 20:45:13,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/data/2e6c4214c/f091a8e1fd4f4eb6887fcc0b9167b0dd [2019-12-07 20:45:13,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:45:13,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:45:13,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:45:13,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:45:13,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:45:13,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c052161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13, skipping insertion in model container [2019-12-07 20:45:13,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:45:13,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:45:13,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:45:13,746 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:45:13,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:45:13,820 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:45:13,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13 WrapperNode [2019-12-07 20:45:13,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:45:13,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:45:13,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:45:13,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:45:13,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:45:13,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:45:13,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:45:13,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:45:13,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... [2019-12-07 20:45:13,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:45:13,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:45:13,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:45:13,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:45:13,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 20:45:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:45:13,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:45:14,209 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:45:14,209 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 20:45:14,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:14 BoogieIcfgContainer [2019-12-07 20:45:14,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:45:14,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:45:14,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:45:14,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:45:14,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:45:13" (1/3) ... [2019-12-07 20:45:14,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1dccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:45:14, skipping insertion in model container [2019-12-07 20:45:14,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:13" (2/3) ... [2019-12-07 20:45:14,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1dccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:45:14, skipping insertion in model container [2019-12-07 20:45:14,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:14" (3/3) ... [2019-12-07 20:45:14,215 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2019-12-07 20:45:14,221 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:45:14,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-12-07 20:45:14,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-12-07 20:45:14,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:45:14,245 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:45:14,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:45:14,246 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:45:14,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:45:14,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:45:14,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:45:14,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:45:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-12-07 20:45:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:45:14,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:14,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:45:14,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 20:45:14,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:14,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031803692] [2019-12-07 20:45:14,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:14,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:14,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:14,366 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 20:45:14,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:14,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:14,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:14,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:45:14,378 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 20:45:14,378 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:14,381 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 20:45:14,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031803692] [2019-12-07 20:45:14,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:14,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:45:14,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618718983] [2019-12-07 20:45:14,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:14,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:14,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:14,396 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-12-07 20:45:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:14,503 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-12-07 20:45:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:14,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:45:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:14,510 INFO L225 Difference]: With dead ends: 74 [2019-12-07 20:45:14,511 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 20:45:14,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:45:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 20:45:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2019-12-07 20:45:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 20:45:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 20:45:14,535 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2019-12-07 20:45:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:14,536 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 20:45:14,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 20:45:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:45:14,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:14,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:45:14,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:45:14,737 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 20:45:14,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:14,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039352418] [2019-12-07 20:45:14,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:14,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:14,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:14,807 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 20:45:14,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:14,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:14,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:14,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:45:14,824 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 20:45:14,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:14,856 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 20:45:14,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039352418] [2019-12-07 20:45:14,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:14,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:45:14,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600964492] [2019-12-07 20:45:14,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:45:14,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:45:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:45:14,858 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-12-07 20:45:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:14,950 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-12-07 20:45:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:14,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 20:45:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:14,952 INFO L225 Difference]: With dead ends: 51 [2019-12-07 20:45:14,952 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 20:45:14,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 20:45:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 20:45:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 20:45:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 20:45:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-12-07 20:45:14,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2019-12-07 20:45:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:14,957 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-12-07 20:45:14,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:45:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-12-07 20:45:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:45:14,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:14,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:15,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,158 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2019-12-07 20:45:15,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:15,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390180672] [2019-12-07 20:45:15,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:15,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:15,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:15,233 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 20:45:15,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:15,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:15,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:15,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:45:15,240 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 20:45:15,240 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:15,242 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 20:45:15,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390180672] [2019-12-07 20:45:15,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:15,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:45:15,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130492918] [2019-12-07 20:45:15,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:15,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:15,243 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2019-12-07 20:45:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:15,361 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-12-07 20:45:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:15,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:45:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:15,363 INFO L225 Difference]: With dead ends: 82 [2019-12-07 20:45:15,363 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 20:45:15,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 20:45:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 20:45:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2019-12-07 20:45:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 20:45:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 20:45:15,369 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2019-12-07 20:45:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:15,370 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 20:45:15,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 20:45:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:45:15,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:15,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:15,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2019-12-07 20:45:15,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:15,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267650754] [2019-12-07 20:45:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:15,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:15,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:15,657 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 20:45:15,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:15,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:15,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:15,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:45:15,669 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 20:45:15,669 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:15,702 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 20:45:15,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267650754] [2019-12-07 20:45:15,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:15,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:45:15,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599612085] [2019-12-07 20:45:15,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:45:15,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:45:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:45:15,703 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2019-12-07 20:45:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:15,870 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-12-07 20:45:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:15,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 20:45:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:15,872 INFO L225 Difference]: With dead ends: 84 [2019-12-07 20:45:15,872 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 20:45:15,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 20:45:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 20:45:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-12-07 20:45:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 20:45:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 20:45:15,876 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2019-12-07 20:45:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:15,876 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 20:45:15,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:45:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 20:45:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:45:15,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:15,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:16,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1837803479, now seen corresponding path program 1 times [2019-12-07 20:45:16,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:16,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673479400] [2019-12-07 20:45:16,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:16,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 20:45:16,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:16,190 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 20:45:16,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673479400] [2019-12-07 20:45:16,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:16,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 20:45:16,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369599741] [2019-12-07 20:45:16,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:45:16,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:45:16,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:45:16,193 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-12-07 20:45:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:16,211 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-12-07 20:45:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:45:16,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:45:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:16,212 INFO L225 Difference]: With dead ends: 53 [2019-12-07 20:45:16,212 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 20:45:16,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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 20:45:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 20:45:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 20:45:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 20:45:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 20:45:16,217 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 11 [2019-12-07 20:45:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 20:45:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:45:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 20:45:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:45:16,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:16,219 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:16,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 760120087, now seen corresponding path program 1 times [2019-12-07 20:45:16,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:16,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970663198] [2019-12-07 20:45:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,547 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970663198] [2019-12-07 20:45:16,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [443135324] [2019-12-07 20:45:16,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,726 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337103611] [2019-12-07 20:45:16,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:16,805 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 20:45:16,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:16,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:16,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:16,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:45:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:45:16,850 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:45:16,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 20:45:16,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 12 [2019-12-07 20:45:16,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552856793] [2019-12-07 20:45:16,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:16,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:45:16,864 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-12-07 20:45:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:17,220 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-12-07 20:45:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:45:17,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 20:45:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:17,221 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:45:17,221 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 20:45:17,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:45:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 20:45:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-12-07 20:45:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 20:45:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 20:45:17,224 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2019-12-07 20:45:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:17,225 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 20:45:17,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 20:45:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:45:17,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:17,225 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:17,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:17,829 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 760120088, now seen corresponding path program 1 times [2019-12-07 20:45:17,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:17,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212727002] [2019-12-07 20:45:17,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:17,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:17,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,915 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212727002] [2019-12-07 20:45:17,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146225344] [2019-12-07 20:45:17,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:18,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:18,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,079 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964873570] [2019-12-07 20:45:18,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:18,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:45:18,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:18,131 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 20:45:18,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:18,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:18,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:18,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:45:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:45:18,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:45:18,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 20:45:18,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 16 [2019-12-07 20:45:18,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742506306] [2019-12-07 20:45:18,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:45:18,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:18,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:45:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:45:18,468 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2019-12-07 20:45:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:18,991 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 20:45:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:45:18,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 20:45:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:18,992 INFO L225 Difference]: With dead ends: 55 [2019-12-07 20:45:18,992 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 20:45:18,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:45:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 20:45:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-12-07 20:45:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 20:45:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 20:45:18,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 21 [2019-12-07 20:45:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:18,995 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 20:45:18,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:45:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 20:45:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:45:18,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:18,996 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:19,597 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 20:45:19,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 330964202, now seen corresponding path program 1 times [2019-12-07 20:45:19,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:19,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322652463] [2019-12-07 20:45:19,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:19,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:19,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,682 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322652463] [2019-12-07 20:45:19,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [483948397] [2019-12-07 20:45:19,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:19,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:19,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307141856] [2019-12-07 20:45:19,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:19,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:19,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,878 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:19,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 20:45:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332440501] [2019-12-07 20:45:19,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:45:19,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:45:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:45:19,932 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 10 states. [2019-12-07 20:45:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:20,075 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-12-07 20:45:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:45:20,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 20:45:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:20,076 INFO L225 Difference]: With dead ends: 72 [2019-12-07 20:45:20,076 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 20:45:20,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:45:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 20:45:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 20:45:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 20:45:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-12-07 20:45:20,081 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 23 [2019-12-07 20:45:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:20,081 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-12-07 20:45:20,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:45:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-12-07 20:45:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:45:20,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:20,082 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:20,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:20,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -28370902, now seen corresponding path program 2 times [2019-12-07 20:45:20,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:20,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126205334] [2019-12-07 20:45:20,689 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:20,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:45:20,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:45:20,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 20:45:20,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:20,937 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 13 treesize of output 9 [2019-12-07 20:45:20,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:20,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:20,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:20,946 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 20:45:20,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:20,982 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 25 treesize of output 13 [2019-12-07 20:45:20,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:20,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:20,989 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 20:45:20,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-07 20:45:21,050 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 15 treesize of output 7 [2019-12-07 20:45:21,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,054 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 20:45:21,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 20:45:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:21,069 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:21,165 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 20:45:21,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:21,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-12-07 20:45:21,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:45:21,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:21,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 20:45:21,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-12-07 20:45:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:21,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126205334] [2019-12-07 20:45:21,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [344094410] [2019-12-07 20:45:21,387 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:21,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:45:21,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:45:21,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 20:45:21,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:21,592 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 13 treesize of output 9 [2019-12-07 20:45:21,593 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 20:45:21,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:21,607 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 25 treesize of output 13 [2019-12-07 20:45:21,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,614 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 20:45:21,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-07 20:45:21,618 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 15 treesize of output 7 [2019-12-07 20:45:21,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,622 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 20:45:21,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 20:45:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:21,625 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:21,629 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 20:45:21,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,632 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 20:45:21,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2019-12-07 20:45:21,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:21,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:21,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 20:45:21,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2019-12-07 20:45:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:21,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074009371] [2019-12-07 20:45:21,839 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:21,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:45:21,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:45:21,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:45:21,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:22,018 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 13 treesize of output 9 [2019-12-07 20:45:22,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:22,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:22,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:22,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 20:45:22,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:22,103 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 25 treesize of output 13 [2019-12-07 20:45:22,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:22,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:22,108 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 20:45:22,108 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-07 20:45:22,214 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 15 treesize of output 7 [2019-12-07 20:45:22,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:22,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:22,216 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 20:45:22,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 20:45:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:22,219 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:22,222 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 20:45:22,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:22,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:22,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-12-07 20:45:22,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:22,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:22,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:45:22,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:22,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 20:45:22,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-12-07 20:45:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 20:45:22,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:22,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 28 [2019-12-07 20:45:22,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803179466] [2019-12-07 20:45:22,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 20:45:22,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 20:45:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-12-07 20:45:22,313 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 28 states. [2019-12-07 20:45:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:23,256 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 20:45:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:45:23,256 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-12-07 20:45:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:23,257 INFO L225 Difference]: With dead ends: 72 [2019-12-07 20:45:23,257 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 20:45:23,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:45:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 20:45:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 20:45:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 20:45:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-12-07 20:45:23,260 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 33 [2019-12-07 20:45:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:23,260 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-12-07 20:45:23,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 20:45:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-12-07 20:45:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:45:23,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:23,261 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:23,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:23,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332025, now seen corresponding path program 1 times [2019-12-07 20:45:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:23,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585662668] [2019-12-07 20:45:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:24,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:45:24,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:24,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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 20:45:24,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:45:24,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 20:45:24,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,112 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 20:45:24,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 20:45:24,129 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 11 treesize of output 7 [2019-12-07 20:45:24,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,139 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 20:45:24,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2019-12-07 20:45:24,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:24,159 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 39 treesize of output 19 [2019-12-07 20:45:24,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-12-07 20:45:24,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,199 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 40 [2019-12-07 20:45:24,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,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 20:45:24,231 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.0 percent of original size [2019-12-07 20:45:24,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,232 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:24,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2019-12-07 20:45:24,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:24,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 20:45:24,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:24,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2019-12-07 20:45:24,382 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,432 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.8 percent of original size [2019-12-07 20:45:24,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:24,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:67 [2019-12-07 20:45:24,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,462 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[v_prenex_2]} [2019-12-07 20:45:24,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-12-07 20:45:24,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,493 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2019-12-07 20:45:24,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,494 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 20:45:24,533 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.3 percent of original size [2019-12-07 20:45:24,534 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:24,534 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:35 [2019-12-07 20:45:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:24,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:24,671 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 20:45:24,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,674 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 20:45:24,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 20:45:24,849 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 20:45:24,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,854 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:24,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:39 [2019-12-07 20:45:24,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:24,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:24,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:45:24,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:24,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 20:45:24,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-12-07 20:45:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:27,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585662668] [2019-12-07 20:45:27,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [744359255] [2019-12-07 20:45:27,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:27,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 20:45:27,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:27,280 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 5 treesize of output 3 [2019-12-07 20:45:27,280 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,282 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 20:45:27,284 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 20:45:27,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,288 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:45:27,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,299 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 14 treesize of output 30 [2019-12-07 20:45:27,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,316 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 20:45:27,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-12-07 20:45:27,357 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 11 treesize of output 7 [2019-12-07 20:45:27,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,366 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 20:45:27,366 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-12-07 20:45:27,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:27,408 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 31 treesize of output 15 [2019-12-07 20:45:27,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,415 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-12-07 20:45:27,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,468 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 21 treesize of output 36 [2019-12-07 20:45:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,469 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 20:45:27,497 INFO L614 ElimStorePlain]: treesize reduction 12, result has 73.9 percent of original size [2019-12-07 20:45:27,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:27,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:34 [2019-12-07 20:45:27,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:27,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-12-07 20:45:27,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,690 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 20:45:27,690 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 20:45:27,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:29 [2019-12-07 20:45:27,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,697 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 20:45:27,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,699 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 20:45:27,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:27,707 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 20:45:27,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:17 [2019-12-07 20:45:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:27,732 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:27,735 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 20:45:27,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,738 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 20:45:27,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 20:45:27,856 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 20:45:27,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,861 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 20:45:27,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:39 [2019-12-07 20:45:27,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:27,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:27,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:32 [2019-12-07 20:45:28,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,201 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 20:45:28,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-12-07 20:45:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:28,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695562658] [2019-12-07 20:45:28,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:28,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 20:45:28,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:28,270 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 20:45:28,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 20:45:28,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,356 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 14 treesize of output 30 [2019-12-07 20:45:28,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,376 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 20:45:28,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:20 [2019-12-07 20:45:28,422 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 11 treesize of output 7 [2019-12-07 20:45:28,423 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,438 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 11 treesize of output 7 [2019-12-07 20:45:28,438 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,449 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2019-12-07 20:45:28,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:28,501 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 27 treesize of output 11 [2019-12-07 20:45:28,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:28,524 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 31 treesize of output 15 [2019-12-07 20:45:28,524 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,534 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,534 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-12-07 20:45:28,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,605 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 21 treesize of output 36 [2019-12-07 20:45:28,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,606 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 20:45:28,647 INFO L614 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-12-07 20:45:28,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,663 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 19 treesize of output 34 [2019-12-07 20:45:28,663 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:28,699 INFO L614 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2019-12-07 20:45:28,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,700 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:28,700 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 20:45:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:28,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:28,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:28,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-12-07 20:45:28,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,036 INFO L614 ElimStorePlain]: treesize reduction 12, result has 85.0 percent of original size [2019-12-07 20:45:29,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:29,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-12-07 20:45:29,047 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,064 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 1 xjuncts. [2019-12-07 20:45:29,064 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:49 [2019-12-07 20:45:29,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-12-07 20:45:29,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 20:45:29,102 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,128 INFO L614 ElimStorePlain]: treesize reduction 8, result has 77.1 percent of original size [2019-12-07 20:45:29,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,129 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:19 [2019-12-07 20:45:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:29,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:29,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:29,428 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 20:45:29,431 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 20:45:29,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,468 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:29,469 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:29,483 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-12-07 20:45:29,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:29,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:29,865 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 20:45:29,867 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 20:45:29,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,898 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:29,899 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:29,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:29,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:29,911 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-12-07 20:45:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:30,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:30,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 13, 11] total 50 [2019-12-07 20:45:30,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416075693] [2019-12-07 20:45:30,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 20:45:30,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 20:45:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2268, Unknown=1, NotChecked=0, Total=2550 [2019-12-07 20:45:30,343 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 51 states. [2019-12-07 20:45:32,102 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-12-07 20:45:32,473 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2019-12-07 20:45:33,100 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-12-07 20:45:33,394 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-12-07 20:45:33,927 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 20:45:34,242 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 20:45:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:35,086 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-12-07 20:45:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:45:35,087 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 37 [2019-12-07 20:45:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:35,089 INFO L225 Difference]: With dead ends: 132 [2019-12-07 20:45:35,089 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 20:45:35,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 152 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=786, Invalid=3635, Unknown=1, NotChecked=0, Total=4422 [2019-12-07 20:45:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 20:45:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-12-07 20:45:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 20:45:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-12-07 20:45:35,094 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 37 [2019-12-07 20:45:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:35,095 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-12-07 20:45:35,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 20:45:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-12-07 20:45:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:45:35,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:35,096 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:35,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:35,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332024, now seen corresponding path program 1 times [2019-12-07 20:45:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:35,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690837145] [2019-12-07 20:45:35,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:35,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 20:45:35,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:35,926 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 20:45:35,926 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:35,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:35,935 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 20:45:35,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:35,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:35,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:35,941 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 20:45:35,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:35,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2019-12-07 20:45:35,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:35,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:35,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 20:45:35,983 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:35,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:35,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:35,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:24 [2019-12-07 20:45:36,018 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 11 treesize of output 7 [2019-12-07 20:45:36,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,040 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 11 treesize of output 7 [2019-12-07 20:45:36,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:36,055 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:40 [2019-12-07 20:45:36,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,089 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 27 treesize of output 11 [2019-12-07 20:45:36,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,117 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 39 treesize of output 19 [2019-12-07 20:45:36,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,129 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 1 xjuncts. [2019-12-07 20:45:36,129 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:40 [2019-12-07 20:45:36,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,187 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 42 [2019-12-07 20:45:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,188 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 20:45:36,240 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2019-12-07 20:45:36,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,257 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 19 treesize of output 34 [2019-12-07 20:45:36,258 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,306 INFO L614 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-12-07 20:45:36,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:36,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:54 [2019-12-07 20:45:36,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:36,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,581 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 27 treesize of output 11 [2019-12-07 20:45:36,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2019-12-07 20:45:36,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,806 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 20:45:36,807 INFO L614 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-12-07 20:45:36,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,830 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 27 treesize of output 11 [2019-12-07 20:45:36,830 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:36,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:36,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-12-07 20:45:36,850 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:36,965 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 20:45:36,965 INFO L614 ElimStorePlain]: treesize reduction 16, result has 86.0 percent of original size [2019-12-07 20:45:36,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:36,966 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:174, output treesize:98 [2019-12-07 20:45:37,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,024 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 34 treesize of output 26 [2019-12-07 20:45:37,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:37,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,092 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 22 treesize of output 18 [2019-12-07 20:45:37,092 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:37,186 INFO L614 ElimStorePlain]: treesize reduction 8, result has 90.9 percent of original size [2019-12-07 20:45:37,190 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 20:45:37,191 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:37,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,235 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 20:45:37,235 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:37,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,272 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 20:45:37,272 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:114, output treesize:50 [2019-12-07 20:45:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:37,436 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:37,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:37,816 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 20:45:37,827 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:37,839 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,843 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,927 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,933 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,940 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,944 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:37,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:37,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:37,991 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 20:45:38,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:38,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:38,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:39,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:39,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:39,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:39,132 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 20:45:39,139 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 20:45:39,146 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:39,150 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:39,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:39,237 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:39,244 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:39,249 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:39,259 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:39,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:39,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:39,296 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 20:45:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:39,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690837145] [2019-12-07 20:45:39,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1023900737] [2019-12-07 20:45:39,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:40,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 20:45:40,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:40,114 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 20:45:40,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 20:45:40,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,262 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 12 treesize of output 28 [2019-12-07 20:45:40,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,284 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 20:45:40,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 20:45:40,366 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 11 treesize of output 7 [2019-12-07 20:45:40,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,384 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 11 treesize of output 7 [2019-12-07 20:45:40,384 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,395 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-12-07 20:45:40,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:40,485 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 27 treesize of output 11 [2019-12-07 20:45:40,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:40,506 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 31 treesize of output 15 [2019-12-07 20:45:40,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,518 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-12-07 20:45:40,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,641 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 19 treesize of output 34 [2019-12-07 20:45:40,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:40,676 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-12-07 20:45:40,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:40,690 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 23 treesize of output 38 [2019-12-07 20:45:40,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:40,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:40,691 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 20:45:40,728 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-12-07 20:45:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:40,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:40,729 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 20:45:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:41,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:41,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-12-07 20:45:41,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,137 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-12-07 20:45:41,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:41,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-12-07 20:45:41,147 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,182 INFO L614 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-12-07 20:45:41,182 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 1 xjuncts. [2019-12-07 20:45:41,182 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-12-07 20:45:41,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-12-07 20:45:41,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 20:45:41,218 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,244 INFO L614 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-12-07 20:45:41,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,244 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-12-07 20:45:41,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:41,459 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:41,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:41,469 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 20:45:41,479 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 20:45:41,484 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:41,492 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:41,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,575 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:41,581 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:41,587 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:41,591 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:41,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:41,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:41,637 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 20:45:42,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:42,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:42,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:42,327 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 20:45:42,342 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:42,352 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:42,359 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:42,625 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 20:45:42,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:42,633 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:42,641 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:42,653 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:42,671 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:43,062 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-07 20:45:43,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:43,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:43,063 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:349, output treesize:429 [2019-12-07 20:45:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,066 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,080 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,091 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,326 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-12-07 20:45:44,326 INFO L614 ElimStorePlain]: treesize reduction 104, result has 74.4 percent of original size [2019-12-07 20:45:44,337 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,349 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,392 INFO L614 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2019-12-07 20:45:44,402 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,414 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:44,634 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-07 20:45:44,634 INFO L614 ElimStorePlain]: treesize reduction 53, result has 71.5 percent of original size [2019-12-07 20:45:44,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 20:45:44,635 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:381, output treesize:133 [2019-12-07 20:45:44,983 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 20:45:44,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:44,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:45,614 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2019-12-07 20:45:45,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:45,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:45,919 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 20:45:45,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-12-07 20:45:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:45,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631964175] [2019-12-07 20:45:45,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:45,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 20:45:45,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:45,997 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 20:45:45,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 20:45:46,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,023 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 12 treesize of output 28 [2019-12-07 20:45:46,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,044 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 20:45:46,044 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 20:45:46,048 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 11 treesize of output 7 [2019-12-07 20:45:46,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,065 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 11 treesize of output 7 [2019-12-07 20:45:46,065 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,076 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,077 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-12-07 20:45:46,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:46,084 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 27 treesize of output 11 [2019-12-07 20:45:46,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:46,106 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 31 treesize of output 15 [2019-12-07 20:45:46,106 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,115 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-12-07 20:45:46,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,133 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 19 treesize of output 34 [2019-12-07 20:45:46,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,170 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-12-07 20:45:46,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,185 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 23 treesize of output 38 [2019-12-07 20:45:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,186 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 20:45:46,222 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-12-07 20:45:46,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,223 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 20:45:46,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:46,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2019-12-07 20:45:46,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,379 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-12-07 20:45:46,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:46,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-12-07 20:45:46,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,421 INFO L614 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-12-07 20:45:46,421 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 1 xjuncts. [2019-12-07 20:45:46,421 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-12-07 20:45:46,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-12-07 20:45:46,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 20:45:46,457 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,483 INFO L614 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-12-07 20:45:46,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,483 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-12-07 20:45:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:46,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,536 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 20:45:46,541 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 20:45:46,553 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:46,558 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,646 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,652 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,658 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,663 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:46,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:46,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:46,712 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 20:45:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:46,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:47,555 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 20:45:47,566 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 20:45:47,570 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:47,579 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:47,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:47,655 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:47,661 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:47,671 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:47,678 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:47,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:47,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 20:45:47,722 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 20:45:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:48,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:48,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13, 12, 13, 11] total 41 [2019-12-07 20:45:48,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526126673] [2019-12-07 20:45:48,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 20:45:48,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 20:45:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 20:45:48,692 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 42 states. [2019-12-07 20:45:51,303 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-12-07 20:45:51,803 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-12-07 20:45:52,414 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-12-07 20:45:52,826 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 90 [2019-12-07 20:45:53,470 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-12-07 20:45:54,098 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-12-07 20:45:54,516 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-07 20:45:55,256 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-12-07 20:45:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:56,290 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-12-07 20:45:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 20:45:56,291 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 37 [2019-12-07 20:45:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:56,292 INFO L225 Difference]: With dead ends: 143 [2019-12-07 20:45:56,292 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 20:45:56,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=798, Invalid=2862, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 20:45:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 20:45:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2019-12-07 20:45:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 20:45:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-12-07 20:45:56,296 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 37 [2019-12-07 20:45:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:56,296 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-12-07 20:45:56,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 20:45:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-12-07 20:45:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:45:56,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:56,297 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:56,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:56,899 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 20:45:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash 693679770, now seen corresponding path program 1 times [2019-12-07 20:45:56,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:56,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428012816] [2019-12-07 20:45:56,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/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 20:45:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:57,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 20:45:57,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:57,211 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 20:45:57,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 20:45:57,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,236 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 14 treesize of output 30 [2019-12-07 20:45:57,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,255 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 20:45:57,256 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 20:45:57,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2019-12-07 20:45:57,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,270 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 14 treesize of output 30 [2019-12-07 20:45:57,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,290 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 20:45:57,290 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 20:45:57,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2019-12-07 20:45:57,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 20:45:57,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,335 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 20:45:57,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,336 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 20:45:57,355 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 13 treesize of output 9 [2019-12-07 20:45:57,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-12-07 20:45:57,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 20:45:57,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,459 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:37 [2019-12-07 20:45:57,491 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_166|, |v_#memory_$Pointer$.offset_158|], 2=[|v_#memory_int_149|]} [2019-12-07 20:45:57,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 20:45:57,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 20:45:57,554 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 20:45:57,593 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,617 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:51 [2019-12-07 20:45:57,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:57,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 20:45:57,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 20:45:57,715 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:57,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2019-12-07 20:45:57,757 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,778 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:57 [2019-12-07 20:45:57,864 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_168|], 4=[|v_#memory_int_151|]} [2019-12-07 20:45:57,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 20:45:57,871 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:57,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:57,928 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 39 treesize of output 30 [2019-12-07 20:45:57,928 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,002 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.2 percent of original size [2019-12-07 20:45:58,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:58,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-12-07 20:45:58,012 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:58,036 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:91, output treesize:64 [2019-12-07 20:45:58,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:58,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:58,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 20:45:58,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:45:58,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2019-12-07 20:45:58,332 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,396 INFO L614 ElimStorePlain]: treesize reduction 16, result has 82.4 percent of original size [2019-12-07 20:45:58,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:45:58,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2019-12-07 20:45:58,406 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:58,427 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:64 [2019-12-07 20:45:58,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,515 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 53 [2019-12-07 20:45:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:45:58,516 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 20:45:58,558 INFO L614 ElimStorePlain]: treesize reduction 4, result has 93.0 percent of original size [2019-12-07 20:45:58,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 20:45:58,562 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,580 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 1 xjuncts. [2019-12-07 20:45:58,580 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:27 [2019-12-07 20:45:58,706 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 22 treesize of output 10 [2019-12-07 20:45:58,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:45:58,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,711 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 20:45:58,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 20:45:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:58,758 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:58,951 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 20:45:58,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,969 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 20:45:58,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:58,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:58,974 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:37 [2019-12-07 20:45:59,239 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 20:45:59,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:59,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:59,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:69 [2019-12-07 20:45:59,752 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 20:45:59,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:59,804 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 20:45:59,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:45:59,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 20:45:59,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:150, output treesize:149 [2019-12-07 20:46:04,191 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[|v_#memory_int_156|]} [2019-12-07 20:46:04,194 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:46:04,267 INFO L343 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2019-12-07 20:46:04,267 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 176 [2019-12-07 20:46:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:46:04,280 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 176 treesize of output 176 [2019-12-07 20:46:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:46:04,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:46:04,286 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_110], 1=[v_arrayElimCell_111]} [2019-12-07 20:46:04,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428012816] [2019-12-07 20:46:04,298 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@324c2d89 [2019-12-07 20:46:04,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1381744615] [2019-12-07 20:46:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:46:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:46:04,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 20:46:04,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:46:04,567 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@324c2d89 [2019-12-07 20:46:04,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790962268] [2019-12-07 20:46:04,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d4a062-4cf3-4d23-9fdf-67c20938ccaf/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:46:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:46:04,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 20:46:04,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:46:04,647 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@324c2d89 [2019-12-07 20:46:04,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:46:04,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 20:46:04,648 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 20:46:04,648 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:46:05,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 20:46:05,268 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 20:46:05,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:46:05 BoogieIcfgContainer [2019-12-07 20:46:05,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:46:05,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:46:05,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:46:05,269 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:46:05,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:14" (3/4) ... [2019-12-07 20:46:05,271 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 20:46:05,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:46:05,272 INFO L168 Benchmark]: Toolchain (without parser) took 51820.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -256.5 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:46:05,272 INFO L168 Benchmark]: CDTParser took 0.17 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 20:46:05,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:46:05,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.80 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:46:05,273 INFO L168 Benchmark]: Boogie Preprocessor took 22.46 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 20:46:05,273 INFO L168 Benchmark]: RCFGBuilder took 333.77 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:46:05,274 INFO L168 Benchmark]: TraceAbstraction took 51057.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.0 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:46:05,274 INFO L168 Benchmark]: Witness Printer took 3.02 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 20:46:05,275 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.80 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.46 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 333.77 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51057.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.0 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 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: 609]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L585] const int len = 5; [L586] const int data_init = 1; [L564] SLL const last = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) [L568] last->next = last [L569] last->data = data [L570] SLL head = last; [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND FALSE !(len > 1) [L581] last->next = head [L582] return head; [L587] SLL const head = sll_circular_create(len, data_init); [L588] int data_new = 1; [L589] SLL ptr = head; [L591] EXPR ptr->data [L591] COND FALSE !(data_init != ptr->data) [L594] ptr->data = data_new [L595] EXPR ptr->next [L595] ptr = ptr->next [L596] data_new++ [L597] COND TRUE ptr != head [L591] EXPR ptr->data [L591] COND TRUE data_init != ptr->data [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 25 error locations. Result: UNKNOWN, OverallTime: 51.0s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 419 SDtfs, 2741 SDslu, 1318 SDs, 0 SdLazy, 2156 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 877 SyntacticMatches, 34 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=11, 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, 11 MinimizatonAttempts, 214 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1060 ConstructedInterpolants, 94 QuantifiedInterpolants, 371832 SizeOfPredicates, 272 NumberOfNonLiveVariables, 2825 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 536/750 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...