./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.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_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:30:43,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:30:43,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:30:43,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:30:43,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:30:43,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:30:43,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:30:43,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:30:43,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:30:43,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:30:43,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:30:43,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:30:43,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:30:43,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:30:43,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:30:43,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:30:43,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:30:43,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:30:43,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:30:43,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:30:43,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:30:43,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:30:43,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:30:43,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:30:43,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:30:43,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:30:43,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:30:43,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:30:43,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:30:43,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:30:43,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:30:43,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:30:43,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:30:43,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:30:43,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:30:43,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:30:43,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:30:43,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:30:43,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:30:43,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:30:43,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:30:43,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 13:30:43,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:30:43,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:30:43,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:30:43,862 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:30:43,862 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:30:43,863 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:30:43,863 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:30:43,863 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:30:43,863 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:30:43,863 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:30:43,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:30:43,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:30:43,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:30:43,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:30:43,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:30:43,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:30:43,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:30:43,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:30:43,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:30:43,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:30:43,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:30:43,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:30:43,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:30:43,866 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:30:43,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:30:43,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:30:43,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:30:43,867 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_1f696b28-362e-44d7-b0d7-932b04f57056/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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-12-07 13:30:43,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:30:43,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:30:43,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:30:43,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:30:43,978 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:30:43,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-12-07 13:30:44,014 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/99cac457b/68f1f8a5e56f40629bade7bd0a95f752/FLAG4ff231bad [2019-12-07 13:30:44,367 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:30:44,368 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-12-07 13:30:44,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/99cac457b/68f1f8a5e56f40629bade7bd0a95f752/FLAG4ff231bad [2019-12-07 13:30:44,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/99cac457b/68f1f8a5e56f40629bade7bd0a95f752 [2019-12-07 13:30:44,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:30:44,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:30:44,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:30:44,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:30:44,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:30:44,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44, skipping insertion in model container [2019-12-07 13:30:44,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:30:44,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:30:44,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:30:44,655 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:30:44,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:30:44,733 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:30:44,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44 WrapperNode [2019-12-07 13:30:44,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:30:44,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:30:44,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:30:44,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:30:44,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:30:44,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:30:44,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:30:44,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:30:44,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... [2019-12-07 13:30:44,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:30:44,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:30:44,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:30:44,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:30:44,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:30:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:30:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:30:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:30:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:30:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:30:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:30:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:30:44,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:30:45,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:30:45,107 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 13:30:45,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:30:45 BoogieIcfgContainer [2019-12-07 13:30:45,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:30:45,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:30:45,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:30:45,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:30:45,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:30:44" (1/3) ... [2019-12-07 13:30:45,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5499edfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:30:45, skipping insertion in model container [2019-12-07 13:30:45,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:44" (2/3) ... [2019-12-07 13:30:45,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5499edfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:30:45, skipping insertion in model container [2019-12-07 13:30:45,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:30:45" (3/3) ... [2019-12-07 13:30:45,113 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-12-07 13:30:45,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:30:45,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-12-07 13:30:45,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-12-07 13:30:45,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:30:45,146 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:30:45,146 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:30:45,146 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:30:45,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:30:45,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:30:45,146 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:30:45,146 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:30:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-12-07 13:30:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:30:45,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:30:45,166 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 13:30:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash 142487, now seen corresponding path program 1 times [2019-12-07 13:30:45,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055052432] [2019-12-07 13:30:45,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,271 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 13:30:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055052432] [2019-12-07 13:30:45,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:30:45,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614864284] [2019-12-07 13:30:45,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:45,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:45,287 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-12-07 13:30:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,349 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-12-07 13:30:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:45,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:30:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,359 INFO L225 Difference]: With dead ends: 65 [2019-12-07 13:30:45,359 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 13:30:45,361 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 13:30:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 13:30:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-12-07 13:30:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 13:30:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 13:30:45,387 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 3 [2019-12-07 13:30:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,387 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 13:30:45,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 13:30:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:30:45,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:30:45,388 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 13:30:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 142488, now seen corresponding path program 1 times [2019-12-07 13:30:45,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181905219] [2019-12-07 13:30:45,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,424 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 13:30:45,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181905219] [2019-12-07 13:30:45,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:30:45,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348121761] [2019-12-07 13:30:45,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:45,426 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 3 states. [2019-12-07 13:30:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,460 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 13:30:45,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:45,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:30:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,462 INFO L225 Difference]: With dead ends: 44 [2019-12-07 13:30:45,462 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 13:30:45,463 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 13:30:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 13:30:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 13:30:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 13:30:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 13:30:45,467 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 3 [2019-12-07 13:30:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,468 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 13:30:45,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 13:30:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:30:45,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:45,469 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 13:30:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1551632612, now seen corresponding path program 1 times [2019-12-07 13:30:45,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166202735] [2019-12-07 13:30:45,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,502 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 13:30:45,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166202735] [2019-12-07 13:30:45,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:45,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869346746] [2019-12-07 13:30:45,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:45,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:45,504 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 3 states. [2019-12-07 13:30:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,546 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-12-07 13:30:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:45,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:30:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,547 INFO L225 Difference]: With dead ends: 71 [2019-12-07 13:30:45,547 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 13:30:45,547 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 13:30:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 13:30:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-12-07 13:30:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 13:30:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 13:30:45,551 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 7 [2019-12-07 13:30:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,551 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 13:30:45,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 13:30:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:30:45,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:45,552 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 13:30:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1551632611, now seen corresponding path program 1 times [2019-12-07 13:30:45,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658881496] [2019-12-07 13:30:45,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,593 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 13:30:45,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658881496] [2019-12-07 13:30:45,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:45,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066499499] [2019-12-07 13:30:45,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:45,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:45,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:45,594 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2019-12-07 13:30:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,634 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 13:30:45,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:45,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:30:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,635 INFO L225 Difference]: With dead ends: 73 [2019-12-07 13:30:45,635 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 13:30:45,635 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 13:30:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 13:30:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 40. [2019-12-07 13:30:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 13:30:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 13:30:45,640 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 7 [2019-12-07 13:30:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,640 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 13:30:45,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 13:30:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:30:45,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:45,641 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 13:30:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1551533641, now seen corresponding path program 1 times [2019-12-07 13:30:45,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72447557] [2019-12-07 13:30:45,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,661 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 13:30:45,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72447557] [2019-12-07 13:30:45,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:45,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730949414] [2019-12-07 13:30:45,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:45,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:45,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:45,663 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2019-12-07 13:30:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,670 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 13:30:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:45,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:30:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,670 INFO L225 Difference]: With dead ends: 44 [2019-12-07 13:30:45,671 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 13:30:45,671 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 13:30:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 13:30:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-12-07 13:30:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 13:30:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 13:30:45,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2019-12-07 13:30:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,674 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 13:30:45,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 13:30:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:30:45,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:45,675 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 13:30:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -999988614, now seen corresponding path program 1 times [2019-12-07 13:30:45,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35449647] [2019-12-07 13:30:45,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,710 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 13:30:45,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35449647] [2019-12-07 13:30:45,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:45,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:45,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265522750] [2019-12-07 13:30:45,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:45,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:45,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:45,712 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2019-12-07 13:30:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:45,783 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 13:30:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:30:45,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 13:30:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:45,784 INFO L225 Difference]: With dead ends: 52 [2019-12-07 13:30:45,784 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 13:30:45,784 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 13:30:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 13:30:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2019-12-07 13:30:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 13:30:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 13:30:45,787 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 11 [2019-12-07 13:30:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:45,787 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 13:30:45,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 13:30:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:30:45,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:45,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:45,787 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 13:30:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -999988613, now seen corresponding path program 1 times [2019-12-07 13:30:45,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:45,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751152678] [2019-12-07 13:30:45,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,822 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 13:30:45,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751152678] [2019-12-07 13:30:45,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160034779] [2019-12-07 13:30:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:30:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:45,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:30:45,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:45,891 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 13:30:45,891 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:30:45,905 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 13:30:45,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [994011916] [2019-12-07 13:30:45,924 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 13:30:45,924 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:30:45,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:30:45,935 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:30:45,935 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:30:46,041 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:46,214 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:46,410 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:46,963 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:46,974 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:46,986 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,091 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,103 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,426 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,515 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,525 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:47,629 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:30:47,900 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-12-07 13:30:48,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:30:48,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 13 [2019-12-07 13:30:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984644481] [2019-12-07 13:30:48,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:30:48,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:30:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:30:48,203 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2019-12-07 13:30:48,396 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-12-07 13:30:48,549 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 13:30:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:48,817 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-12-07 13:30:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:30:48,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-12-07 13:30:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:48,818 INFO L225 Difference]: With dead ends: 42 [2019-12-07 13:30:48,818 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 13:30:48,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:30:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 13:30:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-12-07 13:30:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 13:30:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 13:30:48,821 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2019-12-07 13:30:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:48,821 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 13:30:48,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:30:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 13:30:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:30:48,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:48,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:49,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:49,023 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 13:30:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1083617165, now seen corresponding path program 1 times [2019-12-07 13:30:49,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:49,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31974082] [2019-12-07 13:30:49,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:49,053 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 13:30:49,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31974082] [2019-12-07 13:30:49,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110956347] [2019-12-07 13:30:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:30:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:49,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:30:49,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:49,089 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 13:30:49,089 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:30:49,096 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 13:30:49,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189470416] [2019-12-07 13:30:49,097 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:30:49,098 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:30:49,098 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:30:49,098 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:30:49,098 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:30:49,126 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:49,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:49,548 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:49,558 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:49,574 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:49,691 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:30:50,053 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 13:30:50,399 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2019-12-07 13:30:50,943 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 13:30:51,404 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-12-07 13:30:51,710 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 13:30:51,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:30:51,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [3, 3, 3] total 14 [2019-12-07 13:30:51,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236486192] [2019-12-07 13:30:51,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:30:51,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:30:51,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:30:51,713 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 11 states. [2019-12-07 13:30:52,061 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-12-07 13:30:52,583 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2019-12-07 13:30:52,789 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-07 13:30:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:53,079 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-12-07 13:30:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:30:53,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-12-07 13:30:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:53,081 INFO L225 Difference]: With dead ends: 62 [2019-12-07 13:30:53,081 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 13:30:53,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:30:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 13:30:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2019-12-07 13:30:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 13:30:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 13:30:53,086 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2019-12-07 13:30:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:53,087 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 13:30:53,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:30:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 13:30:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:30:53,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:53,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:53,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:53,289 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 13:30:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1065269706, now seen corresponding path program 1 times [2019-12-07 13:30:53,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:53,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197636014] [2019-12-07 13:30:53,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,332 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 13:30:53,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197636014] [2019-12-07 13:30:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660139614] [2019-12-07 13:30:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:30:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:53,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:30:53,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:53,380 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 13:30:53,380 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:30:53,388 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 13:30:53,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1435954728] [2019-12-07 13:30:53,390 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:30:53,390 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:30:53,390 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:30:53,390 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:30:53,390 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:30:53,422 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:53,497 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:53,813 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:53,821 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:53,829 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:54,205 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:30:54,617 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 13:30:55,134 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 13:30:55,551 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 13:30:55,782 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 13:30:55,830 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:55,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:30:55,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-12-07 13:30:55,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020786792] [2019-12-07 13:30:55,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:30:55,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:30:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:30:55,831 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2019-12-07 13:30:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:55,846 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-12-07 13:30:55,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:30:55,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 13:30:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:55,847 INFO L225 Difference]: With dead ends: 53 [2019-12-07 13:30:55,847 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 13:30:55,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:30:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 13:30:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 13:30:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 13:30:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 13:30:55,851 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 16 [2019-12-07 13:30:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:55,851 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 13:30:55,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:30:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 13:30:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:30:55,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:55,852 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:56,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:56,053 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 13:30:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1591017951, now seen corresponding path program 2 times [2019-12-07 13:30:56,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:30:56,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259512832] [2019-12-07 13:30:56,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:56,209 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 13:30:56,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259512832] [2019-12-07 13:30:56,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387638216] [2019-12-07 13:30:56,209 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:30:56,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 13:30:56,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:30:56,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 13:30:56,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:56,564 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 13:30:56,564 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:30:56,708 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 13:30:56,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1349275555] [2019-12-07 13:30:56,709 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:30:56,709 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:30:56,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:30:56,710 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:30:56,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:30:56,736 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:56,819 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:57,151 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:57,176 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:57,184 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:30:57,570 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:30:57,843 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 13:30:58,301 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-12-07 13:30:58,832 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 107 [2019-12-07 13:30:59,298 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-07 13:30:59,575 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 13:30:59,647 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:59,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:30:59,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2019-12-07 13:30:59,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734689949] [2019-12-07 13:30:59,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 13:30:59,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:30:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 13:30:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:30:59,648 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 21 states. [2019-12-07 13:31:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:00,597 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-12-07 13:31:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:31:00,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-12-07 13:31:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:00,599 INFO L225 Difference]: With dead ends: 87 [2019-12-07 13:31:00,600 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 13:31:00,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=327, Invalid=1479, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 13:31:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 13:31:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2019-12-07 13:31:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 13:31:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 13:31:00,607 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 28 [2019-12-07 13:31:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:00,608 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 13:31:00,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 13:31:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 13:31:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:31:00,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:00,609 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:00,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:00,810 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 13:31:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1591017950, now seen corresponding path program 1 times [2019-12-07 13:31:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:31:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376122109] [2019-12-07 13:31:00,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:01,033 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 13:31:01,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376122109] [2019-12-07 13:31:01,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189192068] [2019-12-07 13:31:01,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:01,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 13:31:01,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:01,865 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 13:31:01,865 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:02,280 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 13:31:02,604 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-12-07 13:31:23,077 WARN L192 SmtUtils]: Spent 18.08 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-12-07 13:31:23,167 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 13:31:23,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118755667] [2019-12-07 13:31:23,168 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:31:23,168 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:31:23,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:31:23,169 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:31:23,169 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:31:23,196 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:31:23,278 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:31:23,587 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:31:23,596 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:31:23,614 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:31:23,983 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:31:24,634 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-12-07 13:31:25,073 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 107 [2019-12-07 13:31:25,593 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 68 [2019-12-07 13:31:25,916 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 13:31:26,024 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:31:26,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:31:26,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 29 [2019-12-07 13:31:26,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546353239] [2019-12-07 13:31:26,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 13:31:26,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:31:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 13:31:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1413, Unknown=1, NotChecked=0, Total=1640 [2019-12-07 13:31:26,026 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 30 states. [2019-12-07 13:31:26,991 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-12-07 13:31:27,187 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-07 13:31:27,349 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-12-07 13:31:27,557 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-07 13:31:27,930 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-12-07 13:31:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:28,363 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-12-07 13:31:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 13:31:28,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2019-12-07 13:31:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:28,364 INFO L225 Difference]: With dead ends: 119 [2019-12-07 13:31:28,364 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 13:31:28,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=685, Invalid=2736, Unknown=1, NotChecked=0, Total=3422 [2019-12-07 13:31:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 13:31:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2019-12-07 13:31:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 13:31:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 13:31:28,368 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2019-12-07 13:31:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:28,369 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 13:31:28,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 13:31:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 13:31:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:31:28,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:28,369 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 13:31:28,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:28,570 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 13:31:28,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash 40107380, now seen corresponding path program 1 times [2019-12-07 13:31:28,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:31:28,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353488904] [2019-12-07 13:31:28,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:28,988 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 13:31:28,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353488904] [2019-12-07 13:31:28,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184841674] [2019-12-07 13:31:28,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:29,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 13:31:29,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:29,928 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-12-07 13:31:30,056 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 13:31:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 13:31:30,558 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:31,187 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@344ed3dc [2019-12-07 13:31:31,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59109904] [2019-12-07 13:31:31,188 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 13:31:31,188 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:31:31,188 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:31:31,188 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:31:31,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:31:31,195 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@344ed3dc 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 13:31:31,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:31:31,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-12-07 13:31:31,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934866516] [2019-12-07 13:31:31,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:31:31,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:31:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:31:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:31:31,197 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2019-12-07 13:31:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:31:31,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:31,399 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@344ed3dc 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 13:31:31,404 INFO L168 Benchmark]: Toolchain (without parser) took 47016.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 939.3 MB in the beginning and 873.1 MB in the end (delta: 66.3 MB). Peak memory consumption was 363.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:31:31,405 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:31:31,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:31:31,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.13 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 13:31:31,405 INFO L168 Benchmark]: Boogie Preprocessor took 20.81 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 13:31:31,405 INFO L168 Benchmark]: RCFGBuilder took 314.57 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.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:31:31,406 INFO L168 Benchmark]: TraceAbstraction took 46293.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 873.1 MB in the end (delta: 165.2 MB). Peak memory consumption was 357.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:31:31,407 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.13 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 20.81 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 314.57 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.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46293.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 873.1 MB in the end (delta: 165.2 MB). Peak memory consumption was 357.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@344ed3dc de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@344ed3dc: 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 13:31:32,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:31:32,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:31:32,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:31:32,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:31:32,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:31:32,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:31:32,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:31:32,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:31:32,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:31:32,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:31:32,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:31:32,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:31:32,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:31:32,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:31:32,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:31:32,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:31:32,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:31:32,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:31:32,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:31:32,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:31:32,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:31:32,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:31:32,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:31:32,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:31:32,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:31:32,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:31:32,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:31:32,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:31:32,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:31:32,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:31:32,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:31:32,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:31:32,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:31:32,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:31:32,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:31:32,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:31:32,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:31:32,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:31:32,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:31:32,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:31:32,756 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 13:31:32,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:31:32,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:31:32,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:31:32,767 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:31:32,767 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:31:32,767 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:31:32,767 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:31:32,767 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:31:32,768 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:31:32,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:31:32,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:31:32,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:31:32,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:31:32,769 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:31:32,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:31:32,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:31:32,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:31:32,771 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 13:31:32,772 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:31:32,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:31:32,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:31:32,772 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_1f696b28-362e-44d7-b0d7-932b04f57056/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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-12-07 13:31:32,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:31:32,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:31:32,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:31:32,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:31:32,963 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:31:32,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-12-07 13:31:33,012 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/9eda8ac4f/489c89afe6ec4b35b93cd051355d699c/FLAGc20e29565 [2019-12-07 13:31:33,452 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:31:33,452 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-12-07 13:31:33,461 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/9eda8ac4f/489c89afe6ec4b35b93cd051355d699c/FLAGc20e29565 [2019-12-07 13:31:33,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/bin/utaipan/data/9eda8ac4f/489c89afe6ec4b35b93cd051355d699c [2019-12-07 13:31:33,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:31:33,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:31:33,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:31:33,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:31:33,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:31:33,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:31:33" (1/1) ... [2019-12-07 13:31:33,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21518952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:33, skipping insertion in model container [2019-12-07 13:31:33,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:31:33" (1/1) ... [2019-12-07 13:31:33,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:31:33,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:31:34,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:31:34,088 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:31:34,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:31:34,150 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:31:34,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34 WrapperNode [2019-12-07 13:31:34,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:31:34,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:31:34,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:31:34,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:31:34,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:31:34,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:31:34,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:31:34,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:31:34,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... [2019-12-07 13:31:34,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:31:34,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:31:34,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:31:34,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:31:34,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:31:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:31:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:31:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:31:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:31:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:31:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:31:34,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:31:34,555 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:31:34,555 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 13:31:34,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:34 BoogieIcfgContainer [2019-12-07 13:31:34,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:31:34,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:31:34,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:31:34,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:31:34,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:31:33" (1/3) ... [2019-12-07 13:31:34,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:31:34, skipping insertion in model container [2019-12-07 13:31:34,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:34" (2/3) ... [2019-12-07 13:31:34,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:31:34, skipping insertion in model container [2019-12-07 13:31:34,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:34" (3/3) ... [2019-12-07 13:31:34,560 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-12-07 13:31:34,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:31:34,572 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-12-07 13:31:34,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-12-07 13:31:34,592 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:31:34,592 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:31:34,592 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:31:34,592 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:31:34,592 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:31:34,592 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:31:34,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:31:34,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:31:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-12-07 13:31:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:31:34,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:34,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:31:34,608 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 13:31:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 13:31:34,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:34,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119196146] [2019-12-07 13:31:34,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:34,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:31:34,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:34,710 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 13:31:34,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:34,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:34,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:34,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:31:34,723 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 13:31:34,723 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:34,726 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 13:31:34,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119196146] [2019-12-07 13:31:34,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:34,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:31:34,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092134628] [2019-12-07 13:31:34,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:34,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:34,747 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-12-07 13:31:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:34,857 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-12-07 13:31:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:34,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 13:31:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:34,864 INFO L225 Difference]: With dead ends: 74 [2019-12-07 13:31:34,864 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 13:31:34,865 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 13:31:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 13:31:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2019-12-07 13:31:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 13:31:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 13:31:34,888 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2019-12-07 13:31:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:34,888 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 13:31:34,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 13:31:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:31:34,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:34,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:31:35,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:31:35,090 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 13:31:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 13:31:35,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:35,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369675038] [2019-12-07 13:31:35,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:35,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:31:35,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:35,162 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 13:31:35,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:35,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:35,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:35,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:31:35,176 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 13:31:35,176 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:35,216 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 13:31:35,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369675038] [2019-12-07 13:31:35,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:35,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:31:35,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269089074] [2019-12-07 13:31:35,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:31:35,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:35,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:31:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:31:35,218 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-12-07 13:31:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:35,313 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-12-07 13:31:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:35,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 13:31:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:35,315 INFO L225 Difference]: With dead ends: 51 [2019-12-07 13:31:35,315 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 13:31:35,315 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 13:31:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 13:31:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 13:31:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 13:31:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-12-07 13:31:35,320 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2019-12-07 13:31:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:35,320 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-12-07 13:31:35,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:31:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-12-07 13:31:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:31:35,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:35,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:35,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:31:35,522 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 13:31:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2019-12-07 13:31:35,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:35,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194772654] [2019-12-07 13:31:35,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:35,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:31:35,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:35,600 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 13:31:35,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:35,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:35,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:35,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:31:35,607 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 13:31:35,607 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:35,610 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 13:31:35,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194772654] [2019-12-07 13:31:35,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:35,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:31:35,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562865922] [2019-12-07 13:31:35,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:35,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:35,612 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2019-12-07 13:31:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:35,723 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-12-07 13:31:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:35,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:31:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:35,725 INFO L225 Difference]: With dead ends: 82 [2019-12-07 13:31:35,725 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 13:31:35,726 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 13:31:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 13:31:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2019-12-07 13:31:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 13:31:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 13:31:35,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2019-12-07 13:31:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:35,732 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 13:31:35,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 13:31:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:31:35,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:35,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:35,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:31:35,935 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 13:31:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2019-12-07 13:31:35,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:35,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700130868] [2019-12-07 13:31:35,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:36,009 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:31:36,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:36,016 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 13:31:36,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:36,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:36,021 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:36,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:31:36,028 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 13:31:36,028 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:36,061 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 13:31:36,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700130868] [2019-12-07 13:31:36,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:36,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:31:36,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657825804] [2019-12-07 13:31:36,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:31:36,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:31:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:31:36,064 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2019-12-07 13:31:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:36,209 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-12-07 13:31:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:36,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 13:31:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:36,210 INFO L225 Difference]: With dead ends: 84 [2019-12-07 13:31:36,210 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 13:31:36,211 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 13:31:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 13:31:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-12-07 13:31:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 13:31:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 13:31:36,214 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2019-12-07 13:31:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:36,215 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 13:31:36,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:31:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 13:31:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:31:36,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:36,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:36,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:31:36,417 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 13:31:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1837803479, now seen corresponding path program 1 times [2019-12-07 13:31:36,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:36,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160154697] [2019-12-07 13:31:36,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:36,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:31:36,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:36,507 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 13:31:36,507 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:36,515 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 13:31:36,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160154697] [2019-12-07 13:31:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:36,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:31:36,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061204487] [2019-12-07 13:31:36,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:31:36,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:31:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:31:36,517 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-12-07 13:31:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:36,534 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-12-07 13:31:36,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:31:36,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:31:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:36,536 INFO L225 Difference]: With dead ends: 53 [2019-12-07 13:31:36,536 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 13:31:36,536 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 13:31:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 13:31:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 13:31:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 13:31:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 13:31:36,540 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 11 [2019-12-07 13:31:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:36,540 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 13:31:36,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:31:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 13:31:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:31:36,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:36,541 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:36,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:31:36,742 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 13:31:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash 760120087, now seen corresponding path program 1 times [2019-12-07 13:31:36,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:36,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270546612] [2019-12-07 13:31:36,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:36,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:36,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:36,861 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 13:31:36,862 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:36,895 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 13:31:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270546612] [2019-12-07 13:31:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1077089785] [2019-12-07 13:31:36,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:37,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:37,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:37,020 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 13:31:37,020 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:37,024 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 13:31:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667359022] [2019-12-07 13:31:37,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:37,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:31:37,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:37,120 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 13:31:37,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:37,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:37,122 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:31:37,162 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 13:31:37,163 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:37,174 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 13:31:37,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 13:31:37,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 12 [2019-12-07 13:31:37,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444385234] [2019-12-07 13:31:37,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:31:37,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:31:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:31:37,176 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-12-07 13:31:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:37,469 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-12-07 13:31:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:31:37,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 13:31:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:37,470 INFO L225 Difference]: With dead ends: 65 [2019-12-07 13:31:37,470 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 13:31:37,471 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 13:31:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 13:31:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-12-07 13:31:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 13:31:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 13:31:37,475 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2019-12-07 13:31:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:37,476 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 13:31:37,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:31:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 13:31:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:31:37,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:37,477 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:38,078 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 13:31:38,079 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 13:31:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:38,080 INFO L82 PathProgramCache]: Analyzing trace with hash 760120088, now seen corresponding path program 1 times [2019-12-07 13:31:38,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:38,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555048846] [2019-12-07 13:31:38,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:38,158 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:38,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:38,174 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 13:31:38,174 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:38,207 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 13:31:38,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555048846] [2019-12-07 13:31:38,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905201777] [2019-12-07 13:31:38,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:38,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:38,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:38,327 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 13:31:38,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:38,330 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 13:31:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177134236] [2019-12-07 13:31:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:38,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:31:38,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:38,379 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 13:31:38,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:38,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:38,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:38,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:31:38,442 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 13:31:38,442 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:38,695 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 13:31:38,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 13:31:38,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 16 [2019-12-07 13:31:38,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108823179] [2019-12-07 13:31:38,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:31:38,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:31:38,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:31:38,696 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2019-12-07 13:31:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:39,221 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 13:31:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:31:39,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 13:31:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:39,223 INFO L225 Difference]: With dead ends: 55 [2019-12-07 13:31:39,223 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 13:31:39,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:31:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 13:31:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-12-07 13:31:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 13:31:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 13:31:39,226 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 21 [2019-12-07 13:31:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:39,226 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 13:31:39,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:31:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 13:31:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:31:39,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:39,227 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 13:31:39,828 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 13:31:39,830 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 13:31:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 330964202, now seen corresponding path program 1 times [2019-12-07 13:31:39,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:39,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893488561] [2019-12-07 13:31:39,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:39,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:39,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:39,910 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 13:31:39,911 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:39,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 13:31:39,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893488561] [2019-12-07 13:31:39,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2106244499] [2019-12-07 13:31:39,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:40,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:31:40,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:40,055 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 13:31:40,056 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:40,058 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 13:31:40,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013892893] [2019-12-07 13:31:40,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:40,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:31:40,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:40,110 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 13:31:40,110 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:40,156 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 13:31:40,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:31:40,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 13:31:40,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563176140] [2019-12-07 13:31:40,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:31:40,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:40,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:31:40,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:31:40,157 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 10 states. [2019-12-07 13:31:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:40,309 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-12-07 13:31:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:31:40,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 13:31:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:40,310 INFO L225 Difference]: With dead ends: 72 [2019-12-07 13:31:40,310 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 13:31:40,311 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 13:31:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 13:31:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 13:31:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 13:31:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-12-07 13:31:40,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 23 [2019-12-07 13:31:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:40,314 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-12-07 13:31:40,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:31:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-12-07 13:31:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:31:40,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:40,315 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 13:31:40,917 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 13:31:40,917 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 13:31:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash -28370902, now seen corresponding path program 2 times [2019-12-07 13:31:40,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:40,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556140765] [2019-12-07 13:31:40,919 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:41,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:31:41,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:31:41,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 13:31:41,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:41,119 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 13:31:41,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 13:31:41,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:41,166 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 13:31:41,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,173 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 13:31:41,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-07 13:31:41,227 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 13:31:41,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,231 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 13:31:41,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 13:31:41,249 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 13:31:41,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:41,352 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 13:31:41,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,355 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 13:31:41,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-12-07 13:31:41,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:41,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:41,479 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 13:31:41,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-12-07 13:31:41,561 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 13:31:41,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556140765] [2019-12-07 13:31:41,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1508157319] [2019-12-07 13:31:41,561 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:41,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:31:41,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:31:41,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 13:31:41,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:41,751 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 13:31:41,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,759 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 13:31:41,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:41,765 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 13:31:41,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,772 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 13:31:41,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-07 13:31:41,776 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 13:31:41,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,780 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 13:31:41,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 13:31:41,783 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 13:31:41,783 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:41,788 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 13:31:41,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,793 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 13:31:41,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2019-12-07 13:31:41,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:41,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:41,947 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 13:31:41,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2019-12-07 13:31:41,995 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 13:31:41,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731236455] [2019-12-07 13:31:41,995 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:42,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:31:42,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:31:42,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 13:31:42,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:42,185 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 13:31:42,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:42,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:42,192 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:42,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 13:31:42,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:42,266 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 13:31:42,267 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:42,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:42,272 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 13:31:42,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-07 13:31:42,383 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 13:31:42,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:42,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:42,385 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 13:31:42,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 13:31:42,388 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 13:31:42,388 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:42,391 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 13:31:42,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:42,395 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 13:31:42,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-12-07 13:31:42,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:42,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:42,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:42,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:42,473 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 13:31:42,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-12-07 13:31:42,479 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 13:31:42,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:31:42,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 28 [2019-12-07 13:31:42,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897224106] [2019-12-07 13:31:42,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 13:31:42,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 13:31:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:31:42,481 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 28 states. [2019-12-07 13:31:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:43,415 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 13:31:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:31:43,415 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-12-07 13:31:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:43,416 INFO L225 Difference]: With dead ends: 72 [2019-12-07 13:31:43,416 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 13:31:43,416 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 13:31:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 13:31:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 13:31:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 13:31:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-12-07 13:31:43,419 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 33 [2019-12-07 13:31:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:43,420 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-12-07 13:31:43,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 13:31:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-12-07 13:31:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:31:43,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:43,420 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 13:31:44,022 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 13:31:44,023 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 13:31:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332025, now seen corresponding path program 1 times [2019-12-07 13:31:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:44,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39023354] [2019-12-07 13:31:44,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:44,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 13:31:44,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:44,222 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 13:31:44,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:31:44,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,254 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 13:31:44,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,273 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 13:31:44,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 13:31:44,290 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 13:31:44,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,301 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 13:31:44,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2019-12-07 13:31:44,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:44,321 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 13:31:44,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,330 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-12-07 13:31:44,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,361 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 13:31:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,363 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 13:31:44,392 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.0 percent of original size [2019-12-07 13:31:44,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,394 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 13:31:44,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2019-12-07 13:31:44,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:44,536 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 13:31:44,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:44,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,548 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 13:31:44,548 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,599 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.8 percent of original size [2019-12-07 13:31:44,600 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 13:31:44,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:67 [2019-12-07 13:31:44,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,629 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[v_prenex_2]} [2019-12-07 13:31:44,633 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 13:31:44,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:44,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,659 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 13:31:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:44,661 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 13:31:44,706 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.3 percent of original size [2019-12-07 13:31:44,707 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 13:31:44,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:35 [2019-12-07 13:31:44,775 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 13:31:44,776 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:44,839 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 13:31:44,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:44,841 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 13:31:44,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 13:31:45,016 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 13:31:45,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,021 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 13:31:45,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:39 [2019-12-07 13:31:45,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,117 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 13:31:45,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-12-07 13:31:45,248 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 13:31:45,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39023354] [2019-12-07 13:31:45,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375138908] [2019-12-07 13:31:45,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:45,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 13:31:45,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:45,448 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 13:31:45,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 13:31:45,452 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 13:31:45,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:31:45,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,468 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 13:31:45,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,486 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 13:31:45,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-12-07 13:31:45,527 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 13:31:45,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,536 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 13:31:45,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-12-07 13:31:45,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:45,584 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 13:31:45,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,591 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-12-07 13:31:45,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,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 21 treesize of output 36 [2019-12-07 13:31:45,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,642 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 13:31:45,669 INFO L614 ElimStorePlain]: treesize reduction 12, result has 73.9 percent of original size [2019-12-07 13:31:45,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,670 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 13:31:45,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:34 [2019-12-07 13:31:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:45,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,845 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 13:31:45,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:45,861 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 13:31:45,861 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 13:31:45,862 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:29 [2019-12-07 13:31:45,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,869 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 13:31:45,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,870 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 13:31:45,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:45,878 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 13:31:45,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:17 [2019-12-07 13:31:45,902 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 13:31:45,902 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:45,905 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 13:31:45,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:45,907 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 13:31:45,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 13:31:46,051 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 13:31:46,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,055 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 13:31:46,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:39 [2019-12-07 13:31:46,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:32 [2019-12-07 13:31:46,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,392 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 13:31:46,392 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-12-07 13:31:46,395 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 13:31:46,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625849379] [2019-12-07 13:31:46,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:46,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 13:31:46,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:46,475 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 13:31:46,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:31:46,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,560 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 13:31:46,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,581 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 13:31:46,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,581 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:20 [2019-12-07 13:31:46,632 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 13:31:46,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,648 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 13:31:46,648 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,659 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 13:31:46,659 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2019-12-07 13:31:46,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:46,710 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 13:31:46,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:46,731 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 13:31:46,731 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,740 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-12-07 13:31:46,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,808 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 13:31:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,809 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 13:31:46,854 INFO L614 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-12-07 13:31:46,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:46,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, 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 13:31:46,872 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:46,913 INFO L614 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2019-12-07 13:31:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,914 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 13:31:46,914 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 13:31:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:46,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:47,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:47,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,198 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 13:31:47,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:47,262 INFO L614 ElimStorePlain]: treesize reduction 12, result has 85.0 percent of original size [2019-12-07 13:31:47,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:47,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,273 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 13:31:47,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:47,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,290 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 13:31:47,290 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:49 [2019-12-07 13:31:47,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,307 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 13:31:47,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:47,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,333 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 13:31:47,333 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:47,366 INFO L614 ElimStorePlain]: treesize reduction 8, result has 77.1 percent of original size [2019-12-07 13:31:47,366 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 13:31:47,366 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:19 [2019-12-07 13:31:47,486 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 13:31:47,486 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:47,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:47,641 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 13:31:47,644 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 13:31:47,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,676 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 13:31:47,678 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:47,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:47,691 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 13:31:47,691 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-12-07 13:31:47,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:48,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:48,076 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 13:31:48,080 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 13:31:48,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:48,109 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:48,111 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 13:31:48,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:48,122 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 13:31:48,122 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-12-07 13:31:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:48,532 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 13:31:48,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:31:48,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 13, 11] total 50 [2019-12-07 13:31:48,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677979168] [2019-12-07 13:31:48,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 13:31:48,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:31:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 13:31:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2269, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 13:31:48,534 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 51 states. [2019-12-07 13:31:50,318 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-12-07 13:31:50,682 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2019-12-07 13:31:51,281 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-12-07 13:31:51,574 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-12-07 13:31:52,144 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 13:31:52,442 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-07 13:31:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:53,379 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-12-07 13:31:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:31:53,380 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 37 [2019-12-07 13:31:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:53,381 INFO L225 Difference]: With dead ends: 132 [2019-12-07 13:31:53,381 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 13:31:53,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 152 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=799, Invalid=3757, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 13:31:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 13:31:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-12-07 13:31:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:31:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-12-07 13:31:53,387 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 37 [2019-12-07 13:31:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:53,387 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-12-07 13:31:53,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 13:31:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-12-07 13:31:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:31:53,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:53,388 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 13:31:53,989 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 13:31:53,990 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 13:31:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332024, now seen corresponding path program 1 times [2019-12-07 13:31:53,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:31:53,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878409177] [2019-12-07 13:31:53,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:54,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 13:31:54,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:54,221 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 13:31:54,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,230 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 13:31:54,230 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 13:31:54,265 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,265 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 13:31:54,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,279 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 13:31:54,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,289 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 13:31:54,289 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:24 [2019-12-07 13:31:54,316 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 13:31:54,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,338 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 13:31:54,338 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,353 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 13:31:54,353 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:40 [2019-12-07 13:31:54,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:54,388 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 13:31:54,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:54,415 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 13:31:54,415 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,427 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 13:31:54,427 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:40 [2019-12-07 13:31:54,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,477 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 13:31:54,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,478 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 13:31:54,531 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2019-12-07 13:31:54,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,547 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 13:31:54,547 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,595 INFO L614 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-12-07 13:31:54,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,596 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 13:31:54,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:54 [2019-12-07 13:31:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:54,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:54,850 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 13:31:54,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:54,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:54,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:54,874 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 13:31:54,875 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,058 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 13:31:55,059 INFO L614 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-12-07 13:31:55,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:55,075 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 13:31:55,075 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:55,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,093 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 13:31:55,094 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,205 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:31:55,205 INFO L614 ElimStorePlain]: treesize reduction 16, result has 86.0 percent of original size [2019-12-07 13:31:55,206 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 13:31:55,206 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:174, output treesize:98 [2019-12-07 13:31:55,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:55,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,263 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 13:31:55,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,327 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 13:31:55,328 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,425 INFO L614 ElimStorePlain]: treesize reduction 8, result has 90.9 percent of original size [2019-12-07 13:31:55,430 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 13:31:55,430 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,476 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 13:31:55,477 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:55,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:55,511 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 13:31:55,511 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:114, output treesize:50 [2019-12-07 13:31:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:55,685 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 13:31:55,685 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:56,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:56,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:56,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:56,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:56,108 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 13:31:56,121 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 13:31:56,125 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 13:31:56,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:56,208 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 13:31:56,214 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 13:31:56,223 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 13:31:56,228 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 13:31:56,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:56,270 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 13:31:56,270 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 13:31:56,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:56,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:56,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:57,493 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 13:31:57,501 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 13:31:57,510 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 13:31:57,516 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 13:31:57,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:57,607 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 13:31:57,616 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:57,620 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 13:31:57,627 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 13:31:57,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:57,666 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 13:31:57,666 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 13:31:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:58,215 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 13:31:58,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878409177] [2019-12-07 13:31:58,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1139106287] [2019-12-07 13:31:58,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:31:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:58,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 13:31:58,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:58,467 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 13:31:58,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,472 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:31:58,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,608 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 13:31:58,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,630 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 13:31:58,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,631 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 13:31:58,700 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 13:31:58,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,716 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 13:31:58,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,727 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 13:31:58,727 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-12-07 13:31:58,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:58,812 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 13:31:58,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:58,835 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 13:31:58,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-12-07 13:31:58,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:58,960 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 13:31:58,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:58,999 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-12-07 13:31:59,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,014 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 13:31:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,015 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 13:31:59,061 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-12-07 13:31:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,062 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 13:31:59,062 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 13:31:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:59,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,417 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 13:31:59,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:59,480 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-12-07 13:31:59,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:59,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,491 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 13:31:59,492 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:59,527 INFO L614 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-12-07 13:31:59,527 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 13:31:59,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-12-07 13:31:59,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,538 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 13:31:59,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:59,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,565 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 13:31:59,566 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:59,594 INFO L614 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-12-07 13:31:59,594 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 13:31:59,594 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-12-07 13:31:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,790 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 13:31:59,791 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:59,799 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 13:31:59,813 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 13:31:59,818 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 13:31:59,826 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:59,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,904 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 13:31:59,909 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 13:31:59,914 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 13:31:59,918 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 13:31:59,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:59,958 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 13:31:59,958 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 13:32:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:00,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:00,644 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 13:32:00,652 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 13:32:00,658 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 13:32:00,887 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 13:32:00,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:00,895 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 13:32:00,907 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 13:32:00,917 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 13:32:00,937 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 13:32:01,344 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-07 13:32:01,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:01,345 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 13:32:01,345 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:349, output treesize:429 [2019-12-07 13:32:02,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:02,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:02,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:02,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,270 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,525 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-12-07 13:32:02,526 INFO L614 ElimStorePlain]: treesize reduction 104, result has 74.4 percent of original size [2019-12-07 13:32:02,533 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,544 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,585 INFO L614 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2019-12-07 13:32:02,596 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,608 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:02,831 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-07 13:32:02,831 INFO L614 ElimStorePlain]: treesize reduction 53, result has 71.5 percent of original size [2019-12-07 13:32:02,831 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 13:32:02,832 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:381, output treesize:133 [2019-12-07 13:32:03,158 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 13:32:03,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:03,795 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2019-12-07 13:32:04,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,100 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 13:32:04,100 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-12-07 13:32:04,105 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 13:32:04,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644396452] [2019-12-07 13:32:04,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:32:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:32:04,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 13:32:04,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:32:04,180 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 13:32:04,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:32:04,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,211 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 13:32:04,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,236 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 13:32:04,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 13:32:04,242 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 13:32:04,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,262 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 13:32:04,262 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,274 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 13:32:04,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-12-07 13:32:04,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:04,281 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 13:32:04,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:04,302 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 13:32:04,302 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,313 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-12-07 13:32:04,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,333 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 13:32:04,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,372 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-12-07 13:32:04,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,388 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 13:32:04,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,389 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 13:32:04,425 INFO L614 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-12-07 13:32:04,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,425 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 13:32:04,426 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-12-07 13:32:04,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:04,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,525 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 13:32:04,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,589 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-12-07 13:32:04,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:04,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,598 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 13:32:04,599 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,629 INFO L614 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-12-07 13:32:04,629 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 13:32:04,630 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-12-07 13:32:04,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,640 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 13:32:04,640 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,666 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 13:32:04,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,699 INFO L614 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-12-07 13:32:04,699 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 13:32:04,699 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-12-07 13:32:04,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,742 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 13:32:04,742 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:32:04,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:04,755 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 13:32:04,760 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 13:32:04,770 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:04,774 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 13:32:04,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,866 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 13:32:04,872 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 13:32:04,878 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 13:32:04,882 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 13:32:04,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:04,923 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 13:32:04,923 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 13:32:05,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:05,679 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 13:32:05,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 13:32:05,696 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 13:32:05,704 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:05,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:05,781 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 13:32:05,787 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 13:32:05,792 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 13:32:05,796 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 13:32:05,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:05,833 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 13:32:05,833 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:253, output treesize:153 [2019-12-07 13:32:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:06,482 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-12-07 13:32:06,775 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 13:32:06,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:32:06,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13, 12, 13, 11] total 41 [2019-12-07 13:32:06,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428592295] [2019-12-07 13:32:06,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 13:32:06,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:32:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 13:32:06,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 13:32:06,777 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 42 states. [2019-12-07 13:32:09,288 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-12-07 13:32:09,745 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 99 [2019-12-07 13:32:10,315 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-12-07 13:32:10,736 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 90 [2019-12-07 13:32:11,388 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-12-07 13:32:11,891 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-12-07 13:32:12,368 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-07 13:32:12,902 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2019-12-07 13:32:13,599 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-12-07 13:32:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:32:14,820 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-12-07 13:32:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:32:14,821 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 37 [2019-12-07 13:32:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:32:14,822 INFO L225 Difference]: With dead ends: 143 [2019-12-07 13:32:14,822 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 13:32:14,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=865, Invalid=3041, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 13:32:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 13:32:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2019-12-07 13:32:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 13:32:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-12-07 13:32:14,827 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 37 [2019-12-07 13:32:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:32:14,827 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-12-07 13:32:14,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 13:32:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-12-07 13:32:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:32:14,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:32:14,828 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 13:32:15,430 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 13:32:15,431 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 13:32:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:32:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 693679770, now seen corresponding path program 1 times [2019-12-07 13:32:15,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:32:15,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563858406] [2019-12-07 13:32:15,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:32:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:32:15,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 13:32:15,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:32:15,729 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 13:32:15,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 13:32:15,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,755 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 13:32:15,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,774 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 13:32:15,775 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 13:32:15,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2019-12-07 13:32:15,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,789 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 13:32:15,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,809 INFO L614 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-12-07 13:32:15,809 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 13:32:15,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2019-12-07 13:32:15,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,827 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 13:32:15,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,854 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 13:32:15,854 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 13:32:15,876 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 13:32:15,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-12-07 13:32:15,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,950 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 13:32:15,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:15,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:15,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:37 [2019-12-07 13:32:16,010 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_166|, |v_#memory_$Pointer$.offset_158|], 2=[|v_#memory_int_149|]} [2019-12-07 13:32:16,017 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 13:32:16,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:32:16,075 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,114 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 13:32:16,115 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,138 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 13:32:16,138 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:51 [2019-12-07 13:32:16,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,180 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 13:32:16,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,235 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 13:32:16,235 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,276 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 13:32:16,277 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,298 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,298 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:57 [2019-12-07 13:32:16,381 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_168|], 4=[|v_#memory_int_151|]} [2019-12-07 13:32:16,388 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 13:32:16,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,443 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 13:32:16,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,516 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.2 percent of original size [2019-12-07 13:32:16,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,526 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 13:32:16,527 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,550 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 13:32:16,550 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:91, output treesize:64 [2019-12-07 13:32:16,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,775 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 13:32:16,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:32:16,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,852 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 13:32:16,853 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,908 INFO L614 ElimStorePlain]: treesize reduction 16, result has 82.4 percent of original size [2019-12-07 13:32:16,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:32:16,917 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 13:32:16,918 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:16,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:16,938 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 13:32:16,939 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:64 [2019-12-07 13:32:17,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,012 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 13:32:17,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:17,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:17,013 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 13:32:17,057 INFO L614 ElimStorePlain]: treesize reduction 4, result has 93.0 percent of original size [2019-12-07 13:32:17,061 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 13:32:17,061 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:17,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:32:17,077 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:27 [2019-12-07 13:32:17,195 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 13:32:17,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:32:17,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,201 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 13:32:17,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 13:32:17,247 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 13:32:17,247 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:32:17,474 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 13:32:17,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,490 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 13:32:17,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,495 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 13:32:17,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:37 [2019-12-07 13:32:17,779 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 13:32:17,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:17,789 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 13:32:17,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:69 [2019-12-07 13:32:18,328 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 13:32:18,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:18,361 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 13:32:18,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:18,373 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 13:32:18,373 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:150, output treesize:149 [2019-12-07 13:32:22,801 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[|v_#memory_int_156|]} [2019-12-07 13:32:22,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:32:22,869 INFO L343 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2019-12-07 13:32:22,869 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 13:32:22,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:32:22,881 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 13:32:22,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:32:22,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:32:22,887 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_110], 1=[v_arrayElimCell_111]} [2019-12-07 13:32:22,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563858406] [2019-12-07 13:32:22,902 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5ea7de91 [2019-12-07 13:32:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [925555308] [2019-12-07 13:32:22,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:32:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:32:23,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 13:32:23,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:32:23,168 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5ea7de91 [2019-12-07 13:32:23,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454028093] [2019-12-07 13:32:23,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f696b28-362e-44d7-b0d7-932b04f57056/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 13:32:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:32:23,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 13:32:23,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:32:23,244 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5ea7de91 [2019-12-07 13:32:23,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:32:23,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:32:23,244 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 13:32:23,244 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:32:23,848 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 13:32:23,861 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:32:23,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:32:23 BoogieIcfgContainer [2019-12-07 13:32:23,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:32:23,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:32:23,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:32:23,862 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:32:23,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:34" (3/4) ... [2019-12-07 13:32:23,865 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:32:23,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:32:23,866 INFO L168 Benchmark]: Toolchain (without parser) took 50070.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 137.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:32:23,866 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 13:32:23,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:32:23,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.20 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:32:23,866 INFO L168 Benchmark]: Boogie Preprocessor took 23.06 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 13:32:23,866 INFO L168 Benchmark]: RCFGBuilder took 349.28 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:32:23,867 INFO L168 Benchmark]: TraceAbstraction took 49305.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.1 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:32:23,867 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:32:23,868 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 352.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.20 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.06 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 349.28 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49305.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.1 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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: 49.2s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 418 SDtfs, 2747 SDslu, 1309 SDs, 0 SdLazy, 2166 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1120 GetRequests, 877 SyntacticMatches, 34 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3479 ImplicationChecksByTransitivity, 20.9s 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.5s SatisfiabilityAnalysisTime, 18.2s 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...