./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 877ba8a79b8b7ad33de53a48617e3dd4b0411834 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 877ba8a79b8b7ad33de53a48617e3dd4b0411834 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_508 term size 59 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:47:03,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:47:03,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:47:03,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:47:03,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:47:03,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:47:03,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:47:03,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:47:03,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:47:03,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:47:03,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:47:03,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:47:03,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:47:03,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:47:03,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:47:03,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:47:03,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:47:03,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:47:03,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:47:03,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:47:03,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:47:03,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:47:03,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:47:03,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:47:03,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:47:03,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:47:03,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:47:03,688 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:47:03,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:47:03,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:47:03,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:47:03,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:47:03,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:47:03,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:47:03,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:47:03,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:47:03,692 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:47:03,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:47:03,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:47:03,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:47:03,704 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:47:03,704 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:47:03,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:47:03,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:47:03,705 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:47:03,705 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:47:03,705 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:47:03,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:47:03,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:47:03,706 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:47:03,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:47:03,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:47:03,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:47:03,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:47:03,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:47:03,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:47:03,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:47:03,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:47:03,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:47:03,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:47:03,709 INFO L133 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/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 -> 877ba8a79b8b7ad33de53a48617e3dd4b0411834 [2018-10-27 04:47:03,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:47:03,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:47:03,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:47:03,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:47:03,746 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:47:03,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:03,790 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/b8b370859/8a94a5a9200f4f76bc562b815189683b/FLAGc455700f2 [2018-10-27 04:47:04,233 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:47:04,234 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:04,242 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/b8b370859/8a94a5a9200f4f76bc562b815189683b/FLAGc455700f2 [2018-10-27 04:47:04,255 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/b8b370859/8a94a5a9200f4f76bc562b815189683b [2018-10-27 04:47:04,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:47:04,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:47:04,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:04,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:47:04,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:47:04,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694cfa13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04, skipping insertion in model container [2018-10-27 04:47:04,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:47:04,312 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:47:04,554 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:04,560 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:47:04,602 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:04,636 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:47:04,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04 WrapperNode [2018-10-27 04:47:04,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:04,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:04,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:47:04,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:47:04,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:04,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:47:04,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:47:04,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:47:04,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... [2018-10-27 04:47:04,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:47:04,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:47:04,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:47:04,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:47:04,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 [2018-10-27 04:47:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:47:04,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:47:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:47:04,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:47:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:47:04,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:47:06,117 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:47:06,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:06 BoogieIcfgContainer [2018-10-27 04:47:06,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:47:06,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:47:06,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:47:06,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:47:06,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:47:04" (1/3) ... [2018-10-27 04:47:06,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bf374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:06, skipping insertion in model container [2018-10-27 04:47:06,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:04" (2/3) ... [2018-10-27 04:47:06,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bf374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:06, skipping insertion in model container [2018-10-27 04:47:06,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:06" (3/3) ... [2018-10-27 04:47:06,125 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:06,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:47:06,141 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-10-27 04:47:06,154 INFO L257 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2018-10-27 04:47:06,177 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:47:06,177 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:47:06,177 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:47:06,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:47:06,177 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:47:06,178 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:47:06,178 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:47:06,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:47:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-10-27 04:47:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:47:06,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:06,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:06,210 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:06,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 498052662, now seen corresponding path program 1 times [2018-10-27 04:47:06,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:06,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:06,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:47:06,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:06,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:47:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:47:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:06,419 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states. [2018-10-27 04:47:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:07,254 INFO L93 Difference]: Finished difference Result 253 states and 264 transitions. [2018-10-27 04:47:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:47:07,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:47:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:07,264 INFO L225 Difference]: With dead ends: 253 [2018-10-27 04:47:07,264 INFO L226 Difference]: Without dead ends: 249 [2018-10-27 04:47:07,266 INFO L605 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 [2018-10-27 04:47:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-27 04:47:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 209. [2018-10-27 04:47:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-27 04:47:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 218 transitions. [2018-10-27 04:47:07,311 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 218 transitions. Word has length 7 [2018-10-27 04:47:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:07,312 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 218 transitions. [2018-10-27 04:47:07,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:47:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 218 transitions. [2018-10-27 04:47:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:47:07,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:07,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:07,314 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:07,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1740236623, now seen corresponding path program 1 times [2018-10-27 04:47:07,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:47:07,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:07,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:47:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:47:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:07,386 INFO L87 Difference]: Start difference. First operand 209 states and 218 transitions. Second operand 3 states. [2018-10-27 04:47:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:07,642 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-10-27 04:47:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:47:07,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-27 04:47:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:07,645 INFO L225 Difference]: With dead ends: 208 [2018-10-27 04:47:07,645 INFO L226 Difference]: Without dead ends: 208 [2018-10-27 04:47:07,646 INFO L605 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 [2018-10-27 04:47:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-27 04:47:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-10-27 04:47:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-27 04:47:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 217 transitions. [2018-10-27 04:47:07,659 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 217 transitions. Word has length 8 [2018-10-27 04:47:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:07,659 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 217 transitions. [2018-10-27 04:47:07,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:47:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 217 transitions. [2018-10-27 04:47:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 04:47:07,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:07,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:07,663 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:07,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1887239576, now seen corresponding path program 1 times [2018-10-27 04:47:07,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:07,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:07,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:07,732 INFO L87 Difference]: Start difference. First operand 208 states and 217 transitions. Second operand 5 states. [2018-10-27 04:47:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:08,330 INFO L93 Difference]: Finished difference Result 342 states and 358 transitions. [2018-10-27 04:47:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:08,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-27 04:47:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:08,336 INFO L225 Difference]: With dead ends: 342 [2018-10-27 04:47:08,336 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 04:47:08,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 04:47:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 215. [2018-10-27 04:47:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-27 04:47:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 231 transitions. [2018-10-27 04:47:08,349 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 231 transitions. Word has length 9 [2018-10-27 04:47:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:08,349 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 231 transitions. [2018-10-27 04:47:08,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 231 transitions. [2018-10-27 04:47:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 04:47:08,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:08,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:08,352 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:08,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1625115245, now seen corresponding path program 1 times [2018-10-27 04:47:08,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:08,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:08,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:08,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:08,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:08,430 INFO L87 Difference]: Start difference. First operand 215 states and 231 transitions. Second operand 4 states. [2018-10-27 04:47:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:08,590 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-10-27 04:47:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:08,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-27 04:47:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:08,593 INFO L225 Difference]: With dead ends: 214 [2018-10-27 04:47:08,594 INFO L226 Difference]: Without dead ends: 214 [2018-10-27 04:47:08,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-27 04:47:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-10-27 04:47:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-27 04:47:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-10-27 04:47:08,603 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 10 [2018-10-27 04:47:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:08,603 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-10-27 04:47:08,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-10-27 04:47:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:47:08,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:08,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:08,605 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:08,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1675075557, now seen corresponding path program 1 times [2018-10-27 04:47:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:08,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:08,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:08,719 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:08,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:08,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:08,720 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 6 states. [2018-10-27 04:47:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,027 INFO L93 Difference]: Finished difference Result 387 states and 407 transitions. [2018-10-27 04:47:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:09,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-27 04:47:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,029 INFO L225 Difference]: With dead ends: 387 [2018-10-27 04:47:09,029 INFO L226 Difference]: Without dead ends: 387 [2018-10-27 04:47:09,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-27 04:47:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 229. [2018-10-27 04:47:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-27 04:47:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 252 transitions. [2018-10-27 04:47:09,038 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 252 transitions. Word has length 17 [2018-10-27 04:47:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,038 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 252 transitions. [2018-10-27 04:47:09,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 252 transitions. [2018-10-27 04:47:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:47:09,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:09,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:09,040 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:09,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 387919490, now seen corresponding path program 1 times [2018-10-27 04:47:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:09,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:09,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:09,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:09,124 INFO L87 Difference]: Start difference. First operand 229 states and 252 transitions. Second operand 5 states. [2018-10-27 04:47:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:10,017 INFO L93 Difference]: Finished difference Result 326 states and 354 transitions. [2018-10-27 04:47:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:10,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-27 04:47:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:10,019 INFO L225 Difference]: With dead ends: 326 [2018-10-27 04:47:10,019 INFO L226 Difference]: Without dead ends: 326 [2018-10-27 04:47:10,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-27 04:47:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 280. [2018-10-27 04:47:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-27 04:47:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 323 transitions. [2018-10-27 04:47:10,025 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 323 transitions. Word has length 18 [2018-10-27 04:47:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:10,025 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 323 transitions. [2018-10-27 04:47:10,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 323 transitions. [2018-10-27 04:47:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:47:10,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:10,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:10,030 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:10,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:10,034 INFO L82 PathProgramCache]: Analyzing trace with hash -859397619, now seen corresponding path program 1 times [2018-10-27 04:47:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:10,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:10,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:10,136 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:10,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:10,137 INFO L87 Difference]: Start difference. First operand 280 states and 323 transitions. Second operand 6 states. [2018-10-27 04:47:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:10,464 INFO L93 Difference]: Finished difference Result 337 states and 356 transitions. [2018-10-27 04:47:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:10,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-10-27 04:47:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:10,466 INFO L225 Difference]: With dead ends: 337 [2018-10-27 04:47:10,466 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 04:47:10,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 04:47:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 279. [2018-10-27 04:47:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-27 04:47:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2018-10-27 04:47:10,474 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 19 [2018-10-27 04:47:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:10,474 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2018-10-27 04:47:10,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2018-10-27 04:47:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:47:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:10,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:10,477 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1048999236, now seen corresponding path program 1 times [2018-10-27 04:47:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:10,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:10,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:47:10,685 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:10,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:10,686 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand 8 states. [2018-10-27 04:47:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:11,344 INFO L93 Difference]: Finished difference Result 360 states and 381 transitions. [2018-10-27 04:47:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:11,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-27 04:47:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:11,347 INFO L225 Difference]: With dead ends: 360 [2018-10-27 04:47:11,347 INFO L226 Difference]: Without dead ends: 360 [2018-10-27 04:47:11,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:47:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-27 04:47:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 276. [2018-10-27 04:47:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-27 04:47:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2018-10-27 04:47:11,356 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 20 [2018-10-27 04:47:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:11,356 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2018-10-27 04:47:11,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2018-10-27 04:47:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:47:11,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:11,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:11,358 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:11,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash -871522332, now seen corresponding path program 1 times [2018-10-27 04:47:11,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:11,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:11,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:11,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:11,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:11,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:11,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:11,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:11,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:11,442 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand 5 states. [2018-10-27 04:47:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:11,763 INFO L93 Difference]: Finished difference Result 288 states and 316 transitions. [2018-10-27 04:47:11,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:11,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 04:47:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:11,765 INFO L225 Difference]: With dead ends: 288 [2018-10-27 04:47:11,765 INFO L226 Difference]: Without dead ends: 288 [2018-10-27 04:47:11,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-27 04:47:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2018-10-27 04:47:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-27 04:47:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2018-10-27 04:47:11,772 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 20 [2018-10-27 04:47:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:11,773 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2018-10-27 04:47:11,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2018-10-27 04:47:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:47:11,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:11,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:11,774 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:11,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1247388433, now seen corresponding path program 1 times [2018-10-27 04:47:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:11,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:11,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:11,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:11,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:11,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:11,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:11,858 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand 5 states. [2018-10-27 04:47:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:12,101 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2018-10-27 04:47:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:12,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-27 04:47:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:12,103 INFO L225 Difference]: With dead ends: 274 [2018-10-27 04:47:12,103 INFO L226 Difference]: Without dead ends: 274 [2018-10-27 04:47:12,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-27 04:47:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-27 04:47:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-27 04:47:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 313 transitions. [2018-10-27 04:47:12,111 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 313 transitions. Word has length 21 [2018-10-27 04:47:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:12,111 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 313 transitions. [2018-10-27 04:47:12,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 313 transitions. [2018-10-27 04:47:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 04:47:12,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:12,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:12,113 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:12,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -14335674, now seen corresponding path program 1 times [2018-10-27 04:47:12,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:12,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:12,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:12,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:12,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:12,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:12,182 INFO L87 Difference]: Start difference. First operand 274 states and 313 transitions. Second operand 6 states. [2018-10-27 04:47:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,172 INFO L93 Difference]: Finished difference Result 322 states and 339 transitions. [2018-10-27 04:47:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:13,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-27 04:47:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,174 INFO L225 Difference]: With dead ends: 322 [2018-10-27 04:47:13,174 INFO L226 Difference]: Without dead ends: 322 [2018-10-27 04:47:13,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-27 04:47:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 219. [2018-10-27 04:47:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-27 04:47:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2018-10-27 04:47:13,180 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 22 [2018-10-27 04:47:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,181 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2018-10-27 04:47:13,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2018-10-27 04:47:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:47:13,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:13,182 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -891678040, now seen corresponding path program 1 times [2018-10-27 04:47:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:47:13,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:13,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:47:13,431 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 10 states. [2018-10-27 04:47:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:14,098 INFO L93 Difference]: Finished difference Result 442 states and 465 transitions. [2018-10-27 04:47:14,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:47:14,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-27 04:47:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:14,100 INFO L225 Difference]: With dead ends: 442 [2018-10-27 04:47:14,100 INFO L226 Difference]: Without dead ends: 442 [2018-10-27 04:47:14,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-27 04:47:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 218. [2018-10-27 04:47:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-27 04:47:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-10-27 04:47:14,105 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 24 [2018-10-27 04:47:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:14,105 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-10-27 04:47:14,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-10-27 04:47:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 04:47:14,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:14,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:14,106 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:14,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1872215373, now seen corresponding path program 1 times [2018-10-27 04:47:14,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:14,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,658 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-10-27 04:47:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:14,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:14,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:47:14,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:14,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:14,736 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 9 states. [2018-10-27 04:47:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:15,821 INFO L93 Difference]: Finished difference Result 419 states and 460 transitions. [2018-10-27 04:47:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:15,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-27 04:47:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:15,824 INFO L225 Difference]: With dead ends: 419 [2018-10-27 04:47:15,824 INFO L226 Difference]: Without dead ends: 419 [2018-10-27 04:47:15,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-27 04:47:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 217. [2018-10-27 04:47:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 04:47:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2018-10-27 04:47:15,842 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 25 [2018-10-27 04:47:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:15,842 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2018-10-27 04:47:15,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2018-10-27 04:47:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:47:15,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:15,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:15,843 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:15,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1053116750, now seen corresponding path program 1 times [2018-10-27 04:47:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:16,164 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-10-27 04:47:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:47:16,187 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:16,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:16,188 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand 7 states. [2018-10-27 04:47:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:16,514 INFO L93 Difference]: Finished difference Result 430 states and 454 transitions. [2018-10-27 04:47:16,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:16,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-27 04:47:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:16,516 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:47:16,516 INFO L226 Difference]: Without dead ends: 430 [2018-10-27 04:47:16,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-27 04:47:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 221. [2018-10-27 04:47:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:47:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2018-10-27 04:47:16,520 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 28 [2018-10-27 04:47:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:16,520 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2018-10-27 04:47:16,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2018-10-27 04:47:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:47:16,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:16,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:16,522 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:16,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1713119257, now seen corresponding path program 1 times [2018-10-27 04:47:16,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:16,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:16,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:16,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:16,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:47:16,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:16,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:16,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:16,687 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand 7 states. [2018-10-27 04:47:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:17,040 INFO L93 Difference]: Finished difference Result 433 states and 458 transitions. [2018-10-27 04:47:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:17,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-10-27 04:47:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:17,042 INFO L225 Difference]: With dead ends: 433 [2018-10-27 04:47:17,042 INFO L226 Difference]: Without dead ends: 433 [2018-10-27 04:47:17,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-27 04:47:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 226. [2018-10-27 04:47:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-27 04:47:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-10-27 04:47:17,048 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 29 [2018-10-27 04:47:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:17,048 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-10-27 04:47:17,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-10-27 04:47:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:47:17,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:17,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:17,050 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:17,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1567089556, now seen corresponding path program 1 times [2018-10-27 04:47:17,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:17,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:17,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:17,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:17,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:17,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:17,120 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 5 states. [2018-10-27 04:47:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:17,287 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-10-27 04:47:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:17,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-27 04:47:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:17,289 INFO L225 Difference]: With dead ends: 242 [2018-10-27 04:47:17,289 INFO L226 Difference]: Without dead ends: 242 [2018-10-27 04:47:17,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-27 04:47:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2018-10-27 04:47:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-27 04:47:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-10-27 04:47:17,292 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 30 [2018-10-27 04:47:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:17,293 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-10-27 04:47:17,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-10-27 04:47:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:47:17,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:17,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:17,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:17,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1335136123, now seen corresponding path program 1 times [2018-10-27 04:47:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:17,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:17,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:17,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:17,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:17,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:17,484 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 6 states. [2018-10-27 04:47:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:17,653 INFO L93 Difference]: Finished difference Result 295 states and 315 transitions. [2018-10-27 04:47:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:17,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:47:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:17,655 INFO L225 Difference]: With dead ends: 295 [2018-10-27 04:47:17,655 INFO L226 Difference]: Without dead ends: 295 [2018-10-27 04:47:17,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:47:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-27 04:47:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 236. [2018-10-27 04:47:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-27 04:47:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2018-10-27 04:47:17,659 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 31 [2018-10-27 04:47:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:17,659 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2018-10-27 04:47:17,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2018-10-27 04:47:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:47:17,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:17,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:17,665 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:17,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1560453002, now seen corresponding path program 1 times [2018-10-27 04:47:17,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:17,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:17,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:17,847 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:47:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:18,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:18,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:18,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:18,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:18,052 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand 5 states. [2018-10-27 04:47:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:18,385 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-10-27 04:47:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:18,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-27 04:47:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:18,387 INFO L225 Difference]: With dead ends: 246 [2018-10-27 04:47:18,387 INFO L226 Difference]: Without dead ends: 246 [2018-10-27 04:47:18,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-27 04:47:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 235. [2018-10-27 04:47:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-27 04:47:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2018-10-27 04:47:18,390 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 32 [2018-10-27 04:47:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:18,390 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2018-10-27 04:47:18,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2018-10-27 04:47:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 04:47:18,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:18,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:18,391 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:18,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1129402659, now seen corresponding path program 1 times [2018-10-27 04:47:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:18,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:18,563 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:18,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:18,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:18,564 INFO L87 Difference]: Start difference. First operand 235 states and 261 transitions. Second operand 5 states. [2018-10-27 04:47:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:18,742 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2018-10-27 04:47:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:18,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-10-27 04:47:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:18,744 INFO L225 Difference]: With dead ends: 234 [2018-10-27 04:47:18,744 INFO L226 Difference]: Without dead ends: 234 [2018-10-27 04:47:18,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-27 04:47:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-27 04:47:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-27 04:47:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-10-27 04:47:18,747 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 33 [2018-10-27 04:47:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:18,747 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-10-27 04:47:18,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-10-27 04:47:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:47:18,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:18,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:18,748 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:18,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1978887098, now seen corresponding path program 1 times [2018-10-27 04:47:18,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:18,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:18,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:18,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:18,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:18,860 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 6 states. [2018-10-27 04:47:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:19,144 INFO L93 Difference]: Finished difference Result 430 states and 459 transitions. [2018-10-27 04:47:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:19,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-10-27 04:47:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:19,146 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:47:19,146 INFO L226 Difference]: Without dead ends: 430 [2018-10-27 04:47:19,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-27 04:47:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 265. [2018-10-27 04:47:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-27 04:47:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 301 transitions. [2018-10-27 04:47:19,149 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 301 transitions. Word has length 34 [2018-10-27 04:47:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:19,149 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 301 transitions. [2018-10-27 04:47:19,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 301 transitions. [2018-10-27 04:47:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:47:19,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:19,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:19,154 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:19,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1215958181, now seen corresponding path program 1 times [2018-10-27 04:47:19,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:19,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:19,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:19,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:19,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:19,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:19,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:19,234 INFO L87 Difference]: Start difference. First operand 265 states and 301 transitions. Second operand 5 states. [2018-10-27 04:47:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:19,433 INFO L93 Difference]: Finished difference Result 318 states and 341 transitions. [2018-10-27 04:47:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:19,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-10-27 04:47:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:19,435 INFO L225 Difference]: With dead ends: 318 [2018-10-27 04:47:19,435 INFO L226 Difference]: Without dead ends: 318 [2018-10-27 04:47:19,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-27 04:47:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 265. [2018-10-27 04:47:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-27 04:47:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 300 transitions. [2018-10-27 04:47:19,438 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 300 transitions. Word has length 35 [2018-10-27 04:47:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:19,438 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 300 transitions. [2018-10-27 04:47:19,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 300 transitions. [2018-10-27 04:47:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:47:19,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:19,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:19,441 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:19,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1270775359, now seen corresponding path program 1 times [2018-10-27 04:47:19,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:19,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:19,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:47:19,509 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:19,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:19,510 INFO L87 Difference]: Start difference. First operand 265 states and 300 transitions. Second operand 7 states. [2018-10-27 04:47:19,868 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:47:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:20,103 INFO L93 Difference]: Finished difference Result 309 states and 331 transitions. [2018-10-27 04:47:20,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:20,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-10-27 04:47:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:20,106 INFO L225 Difference]: With dead ends: 309 [2018-10-27 04:47:20,106 INFO L226 Difference]: Without dead ends: 309 [2018-10-27 04:47:20,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:47:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-27 04:47:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 266. [2018-10-27 04:47:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-27 04:47:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 301 transitions. [2018-10-27 04:47:20,109 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 301 transitions. Word has length 35 [2018-10-27 04:47:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:20,110 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 301 transitions. [2018-10-27 04:47:20,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 301 transitions. [2018-10-27 04:47:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:47:20,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:20,110 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:20,111 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:20,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash 739330618, now seen corresponding path program 1 times [2018-10-27 04:47:20,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:20,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:20,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:47:20,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:20,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:20,380 INFO L87 Difference]: Start difference. First operand 266 states and 301 transitions. Second operand 11 states. [2018-10-27 04:47:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:20,883 INFO L93 Difference]: Finished difference Result 423 states and 452 transitions. [2018-10-27 04:47:20,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:47:20,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-27 04:47:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:20,885 INFO L225 Difference]: With dead ends: 423 [2018-10-27 04:47:20,885 INFO L226 Difference]: Without dead ends: 423 [2018-10-27 04:47:20,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-27 04:47:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 257. [2018-10-27 04:47:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-27 04:47:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2018-10-27 04:47:20,890 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 36 [2018-10-27 04:47:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:20,890 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2018-10-27 04:47:20,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2018-10-27 04:47:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:47:20,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:20,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:20,891 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:20,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 306353128, now seen corresponding path program 1 times [2018-10-27 04:47:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:21,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:21,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:21,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:21,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:21,032 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand 4 states. [2018-10-27 04:47:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:21,079 INFO L93 Difference]: Finished difference Result 275 states and 292 transitions. [2018-10-27 04:47:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:21,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-27 04:47:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:21,081 INFO L225 Difference]: With dead ends: 275 [2018-10-27 04:47:21,081 INFO L226 Difference]: Without dead ends: 275 [2018-10-27 04:47:21,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-27 04:47:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2018-10-27 04:47:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-27 04:47:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2018-10-27 04:47:21,084 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 37 [2018-10-27 04:47:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:21,085 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2018-10-27 04:47:21,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2018-10-27 04:47:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:47:21,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:21,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:21,086 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:21,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1444412833, now seen corresponding path program 1 times [2018-10-27 04:47:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:21,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:21,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:21,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:47:21,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:21,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:21,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:47:21,262 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand 10 states. [2018-10-27 04:47:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:21,871 INFO L93 Difference]: Finished difference Result 407 states and 433 transitions. [2018-10-27 04:47:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:47:21,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-10-27 04:47:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:21,873 INFO L225 Difference]: With dead ends: 407 [2018-10-27 04:47:21,873 INFO L226 Difference]: Without dead ends: 407 [2018-10-27 04:47:21,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-27 04:47:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 259. [2018-10-27 04:47:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-27 04:47:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-10-27 04:47:21,876 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 37 [2018-10-27 04:47:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:21,876 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-10-27 04:47:21,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-10-27 04:47:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:47:21,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:21,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:21,877 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:21,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1878016970, now seen corresponding path program 1 times [2018-10-27 04:47:21,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:21,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:21,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:21,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:21,937 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 5 states. [2018-10-27 04:47:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:22,131 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2018-10-27 04:47:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:22,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-10-27 04:47:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:22,133 INFO L225 Difference]: With dead ends: 299 [2018-10-27 04:47:22,133 INFO L226 Difference]: Without dead ends: 299 [2018-10-27 04:47:22,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-27 04:47:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 260. [2018-10-27 04:47:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 04:47:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 290 transitions. [2018-10-27 04:47:22,136 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 290 transitions. Word has length 43 [2018-10-27 04:47:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:22,136 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 290 transitions. [2018-10-27 04:47:22,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 290 transitions. [2018-10-27 04:47:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:47:22,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:22,137 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:22,138 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:22,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2090606997, now seen corresponding path program 1 times [2018-10-27 04:47:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:22,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:22,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:22,219 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:22,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:47:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:47:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:22,220 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand 3 states. [2018-10-27 04:47:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:22,263 INFO L93 Difference]: Finished difference Result 357 states and 401 transitions. [2018-10-27 04:47:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:47:22,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-27 04:47:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:22,265 INFO L225 Difference]: With dead ends: 357 [2018-10-27 04:47:22,265 INFO L226 Difference]: Without dead ends: 357 [2018-10-27 04:47:22,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-27 04:47:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 266. [2018-10-27 04:47:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-27 04:47:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 298 transitions. [2018-10-27 04:47:22,269 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 298 transitions. Word has length 43 [2018-10-27 04:47:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:22,269 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 298 transitions. [2018-10-27 04:47:22,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:47:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 298 transitions. [2018-10-27 04:47:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:47:22,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:22,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:22,275 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:22,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2033348695, now seen corresponding path program 1 times [2018-10-27 04:47:22,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:47:22,391 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:22,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:22,392 INFO L87 Difference]: Start difference. First operand 266 states and 298 transitions. Second operand 6 states. [2018-10-27 04:47:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:22,618 INFO L93 Difference]: Finished difference Result 395 states and 440 transitions. [2018-10-27 04:47:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:22,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-10-27 04:47:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:22,620 INFO L225 Difference]: With dead ends: 395 [2018-10-27 04:47:22,620 INFO L226 Difference]: Without dead ends: 395 [2018-10-27 04:47:22,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:47:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-27 04:47:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 270. [2018-10-27 04:47:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-27 04:47:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 302 transitions. [2018-10-27 04:47:22,624 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 302 transitions. Word has length 43 [2018-10-27 04:47:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:22,624 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 302 transitions. [2018-10-27 04:47:22,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 302 transitions. [2018-10-27 04:47:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:47:22,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:22,625 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:22,625 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:22,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash -551610469, now seen corresponding path program 1 times [2018-10-27 04:47:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:22,859 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-27 04:47:23,074 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 5 [2018-10-27 04:47:23,278 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 04:47:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:23,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:47:23,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:23,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:23,313 INFO L87 Difference]: Start difference. First operand 270 states and 302 transitions. Second operand 9 states. [2018-10-27 04:47:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:23,728 INFO L93 Difference]: Finished difference Result 382 states and 413 transitions. [2018-10-27 04:47:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:47:23,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-27 04:47:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:23,731 INFO L225 Difference]: With dead ends: 382 [2018-10-27 04:47:23,731 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 04:47:23,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:47:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 04:47:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 288. [2018-10-27 04:47:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-27 04:47:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2018-10-27 04:47:23,734 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 45 [2018-10-27 04:47:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:23,735 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2018-10-27 04:47:23,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2018-10-27 04:47:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:47:23,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:23,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:23,736 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:23,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1514117763, now seen corresponding path program 1 times [2018-10-27 04:47:23,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:23,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:23,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:23,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:23,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:23,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-27 04:47:23,892 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [17], [22], [26], [32], [35], [37], [39], [65], [67], [69], [74], [76], [78], [84], [88], [94], [98], [100], [103], [226], [230], [235], [239], [247], [253], [254], [255], [257], [261], [265], [343], [348], [352], [358], [360], [362], [468], [469], [470] [2018-10-27 04:47:23,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:23,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:24,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:24,808 INFO L272 AbstractInterpreter]: Visited 46 different actions 64 times. Merged at 13 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 49 variables. [2018-10-27 04:47:24,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:24,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:24,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:24,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:24,829 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:24,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:24,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:47:25,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:47:25,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:47:25,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:47:25,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-10-27 04:47:25,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:47:25,111 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-10-27 04:47:25,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:47:25,126 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-10-27 04:47:25,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,137 INFO L267 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. [2018-10-27 04:47:25,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-10-27 04:47:25,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:47:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:25,379 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-10-27 04:47:25,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:47:25,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:25,456 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-10-27 04:47:25,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:18 [2018-10-27 04:47:25,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:47:25,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:47:25,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:47:25,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:47:25,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:25,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:47:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:25,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:26,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-10-27 04:47:26,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:47:26,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-10-27 04:47:26,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-27 04:47:26,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:47:26,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-10-27 04:47:26,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:26,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:26,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:26,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-10-27 04:47:26,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:47:26,411 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-10-27 04:47:26,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-10-27 04:47:26,448 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:26,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-27 04:47:26,459 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:47:26,470 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:26,480 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:26,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:26,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:26,537 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 [2018-10-27 04:47:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:26,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:26,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-10-27 04:47:26,592 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:26,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:47:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:47:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:26,593 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 14 states. [2018-10-27 04:47:27,142 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-10-27 04:47:27,956 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 04:47:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:28,464 INFO L93 Difference]: Finished difference Result 348 states and 381 transitions. [2018-10-27 04:47:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:47:28,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-10-27 04:47:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:28,466 INFO L225 Difference]: With dead ends: 348 [2018-10-27 04:47:28,466 INFO L226 Difference]: Without dead ends: 348 [2018-10-27 04:47:28,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:47:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-27 04:47:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 296. [2018-10-27 04:47:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-27 04:47:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 329 transitions. [2018-10-27 04:47:28,472 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 329 transitions. Word has length 48 [2018-10-27 04:47:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:28,472 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 329 transitions. [2018-10-27 04:47:28,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:47:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 329 transitions. [2018-10-27 04:47:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:47:28,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:28,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:28,474 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:28,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash -776207397, now seen corresponding path program 1 times [2018-10-27 04:47:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:28,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:28,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:47:28,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:28,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:28,640 INFO L87 Difference]: Start difference. First operand 296 states and 329 transitions. Second operand 11 states. [2018-10-27 04:47:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:29,626 INFO L93 Difference]: Finished difference Result 565 states and 599 transitions. [2018-10-27 04:47:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 04:47:29,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-10-27 04:47:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:29,628 INFO L225 Difference]: With dead ends: 565 [2018-10-27 04:47:29,628 INFO L226 Difference]: Without dead ends: 565 [2018-10-27 04:47:29,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:47:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-27 04:47:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 308. [2018-10-27 04:47:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-27 04:47:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 342 transitions. [2018-10-27 04:47:29,632 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 342 transitions. Word has length 49 [2018-10-27 04:47:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:29,632 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 342 transitions. [2018-10-27 04:47:29,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 342 transitions. [2018-10-27 04:47:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:47:29,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:29,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:29,633 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:29,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1394733219, now seen corresponding path program 1 times [2018-10-27 04:47:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:29,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:29,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:29,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:29,738 INFO L87 Difference]: Start difference. First operand 308 states and 342 transitions. Second operand 4 states. [2018-10-27 04:47:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:29,877 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2018-10-27 04:47:29,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:29,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-27 04:47:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:29,879 INFO L225 Difference]: With dead ends: 316 [2018-10-27 04:47:29,879 INFO L226 Difference]: Without dead ends: 316 [2018-10-27 04:47:29,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-27 04:47:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 307. [2018-10-27 04:47:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-27 04:47:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 341 transitions. [2018-10-27 04:47:29,884 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 341 transitions. Word has length 51 [2018-10-27 04:47:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:29,884 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 341 transitions. [2018-10-27 04:47:29,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 341 transitions. [2018-10-27 04:47:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:47:29,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:29,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:29,885 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:29,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2107116965, now seen corresponding path program 1 times [2018-10-27 04:47:29,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:29,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:29,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,190 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-27 04:47:30,475 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-27 04:47:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:30,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:30,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:47:30,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:30,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:47:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:47:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:30,656 INFO L87 Difference]: Start difference. First operand 307 states and 341 transitions. Second operand 17 states. [2018-10-27 04:47:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:32,278 INFO L93 Difference]: Finished difference Result 497 states and 535 transitions. [2018-10-27 04:47:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 04:47:32,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-10-27 04:47:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:32,280 INFO L225 Difference]: With dead ends: 497 [2018-10-27 04:47:32,280 INFO L226 Difference]: Without dead ends: 497 [2018-10-27 04:47:32,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 04:47:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-27 04:47:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 333. [2018-10-27 04:47:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-27 04:47:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 370 transitions. [2018-10-27 04:47:32,285 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 370 transitions. Word has length 51 [2018-10-27 04:47:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:32,285 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 370 transitions. [2018-10-27 04:47:32,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:47:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 370 transitions. [2018-10-27 04:47:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:47:32,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:32,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:32,287 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:32,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash 109580135, now seen corresponding path program 1 times [2018-10-27 04:47:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:32,458 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 04:47:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:32,747 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:32,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:32,748 INFO L87 Difference]: Start difference. First operand 333 states and 370 transitions. Second operand 5 states. [2018-10-27 04:47:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:32,925 INFO L93 Difference]: Finished difference Result 337 states and 374 transitions. [2018-10-27 04:47:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:32,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-27 04:47:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:32,927 INFO L225 Difference]: With dead ends: 337 [2018-10-27 04:47:32,927 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 04:47:32,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 04:47:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2018-10-27 04:47:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-27 04:47:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 366 transitions. [2018-10-27 04:47:32,931 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 366 transitions. Word has length 52 [2018-10-27 04:47:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:32,931 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 366 transitions. [2018-10-27 04:47:32,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 366 transitions. [2018-10-27 04:47:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:47:32,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:32,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:32,932 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:32,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash 287057039, now seen corresponding path program 1 times [2018-10-27 04:47:32,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:33,118 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:47:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:33,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:33,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-27 04:47:33,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:33,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:47:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:47:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:33,315 INFO L87 Difference]: Start difference. First operand 330 states and 366 transitions. Second operand 16 states. [2018-10-27 04:47:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:34,496 INFO L93 Difference]: Finished difference Result 542 states and 577 transitions. [2018-10-27 04:47:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 04:47:34,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-27 04:47:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:34,499 INFO L225 Difference]: With dead ends: 542 [2018-10-27 04:47:34,499 INFO L226 Difference]: Without dead ends: 542 [2018-10-27 04:47:34,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 04:47:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-27 04:47:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 369. [2018-10-27 04:47:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-27 04:47:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 420 transitions. [2018-10-27 04:47:34,507 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 420 transitions. Word has length 52 [2018-10-27 04:47:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:34,507 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 420 transitions. [2018-10-27 04:47:34,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:47:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 420 transitions. [2018-10-27 04:47:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:47:34,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:34,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:34,508 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:34,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 896116802, now seen corresponding path program 1 times [2018-10-27 04:47:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:34,830 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-27 04:47:35,007 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-27 04:47:35,579 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-27 04:47:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:35,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-27 04:47:35,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:35,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:47:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:47:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:35,623 INFO L87 Difference]: Start difference. First operand 369 states and 420 transitions. Second operand 16 states. [2018-10-27 04:47:36,371 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-10-27 04:47:36,726 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 94 [2018-10-27 04:47:37,089 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2018-10-27 04:47:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:38,347 INFO L93 Difference]: Finished difference Result 506 states and 557 transitions. [2018-10-27 04:47:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 04:47:38,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-27 04:47:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:38,349 INFO L225 Difference]: With dead ends: 506 [2018-10-27 04:47:38,350 INFO L226 Difference]: Without dead ends: 506 [2018-10-27 04:47:38,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:47:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-27 04:47:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 370. [2018-10-27 04:47:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-27 04:47:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 420 transitions. [2018-10-27 04:47:38,355 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 420 transitions. Word has length 52 [2018-10-27 04:47:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:38,355 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 420 transitions. [2018-10-27 04:47:38,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:47:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 420 transitions. [2018-10-27 04:47:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:47:38,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:38,356 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:38,356 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:38,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 308833829, now seen corresponding path program 1 times [2018-10-27 04:47:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:38,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:38,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-27 04:47:38,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:38,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:47:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:47:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:38,628 INFO L87 Difference]: Start difference. First operand 370 states and 420 transitions. Second operand 16 states. [2018-10-27 04:47:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:39,555 INFO L93 Difference]: Finished difference Result 540 states and 576 transitions. [2018-10-27 04:47:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:47:39,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-10-27 04:47:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:39,557 INFO L225 Difference]: With dead ends: 540 [2018-10-27 04:47:39,557 INFO L226 Difference]: Without dead ends: 540 [2018-10-27 04:47:39,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:47:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-27 04:47:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 370. [2018-10-27 04:47:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-27 04:47:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 419 transitions. [2018-10-27 04:47:39,562 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 419 transitions. Word has length 53 [2018-10-27 04:47:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:39,565 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 419 transitions. [2018-10-27 04:47:39,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:47:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 419 transitions. [2018-10-27 04:47:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:47:39,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:39,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:39,566 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:39,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 983914321, now seen corresponding path program 1 times [2018-10-27 04:47:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:39,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:39,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:39,664 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:39,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:39,664 INFO L87 Difference]: Start difference. First operand 370 states and 419 transitions. Second operand 5 states. [2018-10-27 04:47:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:39,822 INFO L93 Difference]: Finished difference Result 374 states and 420 transitions. [2018-10-27 04:47:39,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:39,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-10-27 04:47:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:39,824 INFO L225 Difference]: With dead ends: 374 [2018-10-27 04:47:39,824 INFO L226 Difference]: Without dead ends: 374 [2018-10-27 04:47:39,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-27 04:47:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 361. [2018-10-27 04:47:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-27 04:47:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 405 transitions. [2018-10-27 04:47:39,828 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 405 transitions. Word has length 54 [2018-10-27 04:47:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:39,828 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 405 transitions. [2018-10-27 04:47:39,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 405 transitions. [2018-10-27 04:47:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:47:39,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:39,829 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:39,829 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:39,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1142962995, now seen corresponding path program 1 times [2018-10-27 04:47:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:39,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:39,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:40,187 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 04:47:40,375 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-10-27 04:47:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:40,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:40,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:40,450 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-10-27 04:47:40,450 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [17], [22], [26], [32], [41], [43], [45], [47], [49], [51], [53], [55], [57], [59], [61], [65], [67], [69], [72], [84], [88], [94], [98], [100], [103], [226], [230], [235], [239], [247], [253], [254], [255], [257], [261], [265], [343], [348], [352], [358], [360], [362], [468], [469], [470] [2018-10-27 04:47:40,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:40,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:41,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:41,009 INFO L272 AbstractInterpreter]: Visited 52 different actions 70 times. Merged at 13 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 55 variables. [2018-10-27 04:47:41,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:41,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:41,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:41,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:41,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:41,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:41,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:41,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:47:41,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-27 04:47:41,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:47:41,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 4 [2018-10-27 04:47:41,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-10-27 04:47:41,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 4 [2018-10-27 04:47:41,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:47:41,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-27 04:47:41,515 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:41,525 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:65, output treesize:17 [2018-10-27 04:47:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:41,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:41,699 INFO L477 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 31 treesize of output 35 [2018-10-27 04:47:41,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 28 [2018-10-27 04:47:41,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-27 04:47:41,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-10-27 04:47:41,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:41,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:47:41,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-27 04:47:41,744 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-10-27 04:47:41,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-27 04:47:41,782 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,786 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,787 INFO L477 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 17 treesize of output 15 [2018-10-27 04:47:41,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-27 04:47:41,790 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,793 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:41,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:41,799 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:63, output treesize:17 [2018-10-27 04:47:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:41,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [10] total 26 [2018-10-27 04:47:41,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:41,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:47:41,852 INFO L87 Difference]: Start difference. First operand 361 states and 405 transitions. Second operand 10 states. [2018-10-27 04:47:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:42,577 INFO L93 Difference]: Finished difference Result 513 states and 559 transitions. [2018-10-27 04:47:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:47:42,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-10-27 04:47:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:42,580 INFO L225 Difference]: With dead ends: 513 [2018-10-27 04:47:42,580 INFO L226 Difference]: Without dead ends: 513 [2018-10-27 04:47:42,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 04:47:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-27 04:47:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 377. [2018-10-27 04:47:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-27 04:47:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 422 transitions. [2018-10-27 04:47:42,587 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 422 transitions. Word has length 54 [2018-10-27 04:47:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:42,588 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 422 transitions. [2018-10-27 04:47:42,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 422 transitions. [2018-10-27 04:47:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:47:42,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:42,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:42,589 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:42,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 648864275, now seen corresponding path program 1 times [2018-10-27 04:47:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:42,795 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:47:42,979 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:47:43,847 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-27 04:47:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:43,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:43,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-27 04:47:43,933 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:43,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:47:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:47:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:47:43,934 INFO L87 Difference]: Start difference. First operand 377 states and 422 transitions. Second operand 21 states. [2018-10-27 04:47:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:45,508 INFO L93 Difference]: Finished difference Result 521 states and 561 transitions. [2018-10-27 04:47:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 04:47:45,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-10-27 04:47:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:45,511 INFO L225 Difference]: With dead ends: 521 [2018-10-27 04:47:45,511 INFO L226 Difference]: Without dead ends: 521 [2018-10-27 04:47:45,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 04:47:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-27 04:47:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2018-10-27 04:47:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-27 04:47:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 420 transitions. [2018-10-27 04:47:45,516 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 420 transitions. Word has length 56 [2018-10-27 04:47:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:45,516 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 420 transitions. [2018-10-27 04:47:45,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:47:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 420 transitions. [2018-10-27 04:47:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:47:45,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:45,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:45,517 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:45,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 107931887, now seen corresponding path program 1 times [2018-10-27 04:47:45,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:45,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:45,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:45,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:45,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:45,726 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 04:47:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:46,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:46,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:46,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 04:47:46,026 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [17], [22], [26], [32], [41], [43], [45], [47], [49], [51], [53], [55], [57], [59], [61], [65], [67], [69], [74], [76], [78], [84], [88], [94], [98], [100], [103], [226], [230], [235], [239], [247], [253], [254], [255], [257], [261], [265], [343], [348], [352], [358], [360], [362], [468], [469], [470] [2018-10-27 04:47:46,029 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:46,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:46,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:46,487 INFO L272 AbstractInterpreter]: Visited 54 different actions 72 times. Merged at 13 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 55 variables. [2018-10-27 04:47:46,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:46,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:46,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:46,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:46,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:46,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:46,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:46,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:46,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:46,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:47:46,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-27 04:47:46,574 INFO L477 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 13 treesize of output 10 [2018-10-27 04:47:46,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-10-27 04:47:46,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-10-27 04:47:46,621 INFO L477 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 44 treesize of output 38 [2018-10-27 04:47:46,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:47:46,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2018-10-27 04:47:46,641 INFO L477 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 44 treesize of output 38 [2018-10-27 04:47:46,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:47:46,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-10-27 04:47:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:47:46,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:49,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 82 [2018-10-27 04:47:49,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 10 [2018-10-27 04:47:49,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,087 INFO L477 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 0 case distinctions, treesize of input 60 treesize of output 53 [2018-10-27 04:47:49,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:47:49,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,113 INFO L477 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 29 treesize of output 26 [2018-10-27 04:47:49,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:47:49,122 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 55 treesize of output 46 [2018-10-27 04:47:49,150 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:47:49,151 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-10-27 04:47:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-27 04:47:49,170 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-10-27 04:47:49,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,180 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,184 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,186 INFO L477 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 24 treesize of output 20 [2018-10-27 04:47:49,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,188 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,192 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:49,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2018-10-27 04:47:49,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-10-27 04:47:49,316 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,381 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-10-27 04:47:49,381 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,386 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-10-27 04:47:49,386 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-10-27 04:47:49,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-10-27 04:47:49,442 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,447 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,448 INFO L477 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 43 treesize of output 37 [2018-10-27 04:47:49,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-10-27 04:47:49,452 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,457 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:49,491 INFO L477 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 46 treesize of output 39 [2018-10-27 04:47:49,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 8 [2018-10-27 04:47:49,495 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,500 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,545 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:49,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:47:49,584 INFO L477 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 0 case distinctions, treesize of input 178 treesize of output 123 [2018-10-27 04:47:49,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:47:49,603 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 70 [2018-10-27 04:47:49,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-10-27 04:47:49,669 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-10-27 04:47:49,670 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,685 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,732 INFO L477 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 2 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 04:47:49,750 INFO L477 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 0 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 63 [2018-10-27 04:47:49,751 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 8 xjuncts. [2018-10-27 04:47:49,805 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2018-10-27 04:47:49,806 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,846 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:49,918 INFO L477 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 41 treesize of output 36 [2018-10-27 04:47:49,924 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-10-27 04:47:49,924 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,932 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,938 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,940 INFO L477 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 41 treesize of output 36 [2018-10-27 04:47:49,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,942 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,956 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-10-27 04:47:49,957 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,962 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:49,965 INFO L477 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 37 treesize of output 34 [2018-10-27 04:47:49,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:47:49,968 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:49,979 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,983 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:49,986 INFO L477 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 45 treesize of output 38 [2018-10-27 04:47:50,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:50,011 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 25 [2018-10-27 04:47:50,039 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-10-27 04:47:50,063 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:50,066 INFO L477 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 41 treesize of output 36 [2018-10-27 04:47:50,167 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-10-27 04:47:50,167 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-27 04:47:50,176 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,186 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 04:47:50,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:47:50,252 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 17 [2018-10-27 04:47:50,270 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,359 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-10-27 04:47:50,359 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-10-27 04:47:50,378 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 11 [2018-10-27 04:47:50,394 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 12 [2018-10-27 04:47:50,396 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,409 INFO L267 ElimStorePlain]: Start of recursive call 50: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:50,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2018-10-27 04:47:50,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 40 treesize of output 28 [2018-10-27 04:47:50,421 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,441 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:47:50,441 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-27 04:47:50,460 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-10-27 04:47:50,465 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 22 [2018-10-27 04:47:50,482 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 28 [2018-10-27 04:47:50,509 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 8 xjuncts. [2018-10-27 04:47:50,544 INFO L267 ElimStorePlain]: Start of recursive call 57: 5 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:47:50,562 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:50,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 83 [2018-10-27 04:47:50,616 INFO L477 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 2 case distinctions, treesize of input 62 treesize of output 70 [2018-10-27 04:47:50,627 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 75 [2018-10-27 04:47:50,628 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 86 [2018-10-27 04:47:50,688 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 8 xjuncts. [2018-10-27 04:47:50,744 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:50,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2018-10-27 04:47:50,924 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-10-27 04:47:50,925 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:50,942 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:51,136 INFO L477 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 44 treesize of output 47 [2018-10-27 04:47:51,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 44 [2018-10-27 04:47:51,156 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:51,185 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:51,395 INFO L477 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 46 treesize of output 41 [2018-10-27 04:47:51,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:47:51,400 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:51,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-10-27 04:47:51,410 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,416 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,421 INFO L477 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 50 treesize of output 43 [2018-10-27 04:47:51,434 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 04:47:51,434 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:51,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:47:51,460 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,476 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:51,478 INFO L477 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 46 treesize of output 41 [2018-10-27 04:47:51,482 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:47:51,482 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:47:51,506 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,511 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2018-10-27 04:47:51,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-10-27 04:47:51,819 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:52,039 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:52,039 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_76 term size 23 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 04:47:52,043 INFO L168 Benchmark]: Toolchain (without parser) took 47783.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 949.1 MB in the beginning and 1.3 GB in the end (delta: -363.4 MB). Peak memory consumption was 579.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,043 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:52,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 924.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 924.9 MB in the beginning and 1.2 GB in the end (delta: -225.8 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,044 INFO L168 Benchmark]: Boogie Preprocessor took 50.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,044 INFO L168 Benchmark]: RCFGBuilder took 1312.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,044 INFO L168 Benchmark]: TraceAbstraction took 45923.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.3 MB). Peak memory consumption was 560.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:52,058 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 924.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 924.9 MB in the beginning and 1.2 GB in the end (delta: -225.8 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1312.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45923.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.3 MB). Peak memory consumption was 560.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_76 term size 23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_76 term size 23: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:47:53,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:47:53,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:47:53,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:47:53,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:47:53,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:47:53,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:47:53,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:47:53,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:47:53,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:47:53,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:47:53,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:47:53,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:47:53,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:47:53,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:47:53,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:47:53,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:47:53,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:47:53,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:47:53,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:47:53,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:47:53,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:47:53,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:47:53,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:47:53,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:47:53,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:47:53,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:47:53,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:47:53,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:47:53,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:47:53,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:47:53,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:47:53,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:47:53,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:47:53,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:47:53,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:47:53,956 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-10-27 04:47:53,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:47:53,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:47:53,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:47:53,967 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:47:53,968 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:47:53,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:47:53,968 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:47:53,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:47:53,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:47:53,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:47:53,969 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:47:53,970 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:47:53,970 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:47:53,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:47:53,970 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-27 04:47:53,972 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-27 04:47:53,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:47:53,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:47:53,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:47:53,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:47:53,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:47:53,973 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-27 04:47:53,973 INFO L133 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/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 -> 877ba8a79b8b7ad33de53a48617e3dd4b0411834 [2018-10-27 04:47:54,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:47:54,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:47:54,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:47:54,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:47:54,033 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:47:54,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:54,082 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/53af3f52a/d94a518aab20403890f195552f706686/FLAGe407fd277 [2018-10-27 04:47:54,509 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:47:54,510 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/sv-benchmarks/c/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:54,519 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/53af3f52a/d94a518aab20403890f195552f706686/FLAGe407fd277 [2018-10-27 04:47:54,530 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/data/53af3f52a/d94a518aab20403890f195552f706686 [2018-10-27 04:47:54,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:47:54,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:47:54,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:54,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:47:54,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:47:54,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:54,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1439afcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54, skipping insertion in model container [2018-10-27 04:47:54,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:54,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:47:54,588 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:47:54,871 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:54,879 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:47:54,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:54,973 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:47:54,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54 WrapperNode [2018-10-27 04:47:54,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:54,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:54,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:47:54,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:47:54,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:54,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:55,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:47:55,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:47:55,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:47:55,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... [2018-10-27 04:47:55,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:47:55,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:47:55,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:47:55,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:47:55,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/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 [2018-10-27 04:47:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:47:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:47:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:47:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:47:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:47:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:47:56,835 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:47:56,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:56 BoogieIcfgContainer [2018-10-27 04:47:56,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:47:56,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:47:56,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:47:56,840 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:47:56,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:47:54" (1/3) ... [2018-10-27 04:47:56,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419f76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:56, skipping insertion in model container [2018-10-27 04:47:56,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:54" (2/3) ... [2018-10-27 04:47:56,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419f76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:56, skipping insertion in model container [2018-10-27 04:47:56,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:56" (3/3) ... [2018-10-27 04:47:56,844 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:47:56,851 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:47:56,857 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-10-27 04:47:56,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2018-10-27 04:47:56,885 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:47:56,885 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:47:56,885 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:47:56,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:47:56,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:47:56,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:47:56,886 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:47:56,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:47:56,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:47:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-10-27 04:47:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:47:56,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:56,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:56,922 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:56,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2130416659, now seen corresponding path program 1 times [2018-10-27 04:47:56,933 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:47:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:47:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:56,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:57,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:57,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:57,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:57,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:47:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:57,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:47:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:47:57,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:47:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:47:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:57,153 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 3 states. [2018-10-27 04:47:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:57,927 INFO L93 Difference]: Finished difference Result 250 states and 261 transitions. [2018-10-27 04:47:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:47:57,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:47:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:57,938 INFO L225 Difference]: With dead ends: 250 [2018-10-27 04:47:57,938 INFO L226 Difference]: Without dead ends: 246 [2018-10-27 04:47:57,939 INFO L605 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 [2018-10-27 04:47:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-27 04:47:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 206. [2018-10-27 04:47:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-27 04:47:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-10-27 04:47:57,982 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 7 [2018-10-27 04:47:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:57,983 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-10-27 04:47:57,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:47:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-10-27 04:47:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:47:57,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:57,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:57,985 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:57,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1618407028, now seen corresponding path program 1 times [2018-10-27 04:47:57,986 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:47:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:47:58,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:58,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:58,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:58,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:58,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:58,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 04:47:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:58,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:47:58,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:58,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:47:58,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:47:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:47:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:58,081 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 3 states. [2018-10-27 04:47:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:58,563 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2018-10-27 04:47:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:47:58,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-27 04:47:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:58,565 INFO L225 Difference]: With dead ends: 205 [2018-10-27 04:47:58,565 INFO L226 Difference]: Without dead ends: 205 [2018-10-27 04:47:58,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:47:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-27 04:47:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-27 04:47:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:47:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 214 transitions. [2018-10-27 04:47:58,577 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 214 transitions. Word has length 8 [2018-10-27 04:47:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:58,577 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 214 transitions. [2018-10-27 04:47:58,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:47:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 214 transitions. [2018-10-27 04:47:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 04:47:58,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:58,578 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:58,580 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:58,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1368989643, now seen corresponding path program 1 times [2018-10-27 04:47:58,581 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:47:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:47:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:58,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:58,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:58,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:58,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:58,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:47:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:58,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:47:58,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:58,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:58,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:58,720 INFO L87 Difference]: Start difference. First operand 205 states and 214 transitions. Second operand 5 states. [2018-10-27 04:47:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:59,534 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-10-27 04:47:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:59,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-27 04:47:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:59,537 INFO L225 Difference]: With dead ends: 347 [2018-10-27 04:47:59,537 INFO L226 Difference]: Without dead ends: 347 [2018-10-27 04:47:59,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-27 04:47:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 212. [2018-10-27 04:47:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-27 04:47:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-10-27 04:47:59,548 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 9 [2018-10-27 04:47:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:59,549 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-10-27 04:47:59,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-10-27 04:47:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 04:47:59,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:59,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:59,552 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:59,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 510994070, now seen corresponding path program 1 times [2018-10-27 04:47:59,553 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:47:59,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:47:59,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:59,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:59,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:59,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:59,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:59,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:47:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:59,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:47:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:59,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:59,719 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 4 states. [2018-10-27 04:48:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:00,239 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2018-10-27 04:48:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:48:00,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-27 04:48:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:00,241 INFO L225 Difference]: With dead ends: 249 [2018-10-27 04:48:00,241 INFO L226 Difference]: Without dead ends: 249 [2018-10-27 04:48:00,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-27 04:48:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 232. [2018-10-27 04:48:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-27 04:48:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2018-10-27 04:48:00,254 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 10 [2018-10-27 04:48:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:00,254 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2018-10-27 04:48:00,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:48:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2018-10-27 04:48:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 04:48:00,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:00,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:00,256 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:00,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash 831674053, now seen corresponding path program 1 times [2018-10-27 04:48:00,257 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:00,257 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:00,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:00,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:00,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:00,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:00,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:00,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:00,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:00,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:00,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:48:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:48:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:48:00,357 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand 4 states. [2018-10-27 04:48:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:01,168 INFO L93 Difference]: Finished difference Result 382 states and 401 transitions. [2018-10-27 04:48:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:48:01,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-27 04:48:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:01,170 INFO L225 Difference]: With dead ends: 382 [2018-10-27 04:48:01,170 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 04:48:01,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 04:48:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 230. [2018-10-27 04:48:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-27 04:48:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 254 transitions. [2018-10-27 04:48:01,179 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 254 transitions. Word has length 16 [2018-10-27 04:48:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:01,179 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 254 transitions. [2018-10-27 04:48:01,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:48:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 254 transitions. [2018-10-27 04:48:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:48:01,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:01,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:01,182 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:01,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash 12276641, now seen corresponding path program 1 times [2018-10-27 04:48:01,183 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:01,183 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:01,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:01,250 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:01,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:48:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:48:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:48:01,252 INFO L87 Difference]: Start difference. First operand 230 states and 254 transitions. Second operand 4 states. [2018-10-27 04:48:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:01,901 INFO L93 Difference]: Finished difference Result 335 states and 366 transitions. [2018-10-27 04:48:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:48:01,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-27 04:48:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:01,903 INFO L225 Difference]: With dead ends: 335 [2018-10-27 04:48:01,903 INFO L226 Difference]: Without dead ends: 335 [2018-10-27 04:48:01,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-27 04:48:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 229. [2018-10-27 04:48:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-27 04:48:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 253 transitions. [2018-10-27 04:48:01,911 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 253 transitions. Word has length 17 [2018-10-27 04:48:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:01,911 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 253 transitions. [2018-10-27 04:48:01,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:48:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2018-10-27 04:48:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:48:01,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:01,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:01,914 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:01,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash 374850887, now seen corresponding path program 1 times [2018-10-27 04:48:01,915 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:01,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:01,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:01,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:02,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:02,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:02,068 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:02,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:02,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:02,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:02,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:02,070 INFO L87 Difference]: Start difference. First operand 229 states and 253 transitions. Second operand 5 states. [2018-10-27 04:48:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:03,305 INFO L93 Difference]: Finished difference Result 330 states and 349 transitions. [2018-10-27 04:48:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:48:03,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-27 04:48:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:03,307 INFO L225 Difference]: With dead ends: 330 [2018-10-27 04:48:03,307 INFO L226 Difference]: Without dead ends: 330 [2018-10-27 04:48:03,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-27 04:48:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 226. [2018-10-27 04:48:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-27 04:48:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-10-27 04:48:03,310 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 18 [2018-10-27 04:48:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:03,311 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-10-27 04:48:03,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-10-27 04:48:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 04:48:03,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:03,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:03,313 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:03,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 380575949, now seen corresponding path program 1 times [2018-10-27 04:48:03,313 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:03,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:03,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:03,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:03,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:03,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:03,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:03,415 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 5 states. [2018-10-27 04:48:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:03,938 INFO L93 Difference]: Finished difference Result 329 states and 347 transitions. [2018-10-27 04:48:03,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:03,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-27 04:48:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:03,940 INFO L225 Difference]: With dead ends: 329 [2018-10-27 04:48:03,941 INFO L226 Difference]: Without dead ends: 329 [2018-10-27 04:48:03,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-27 04:48:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 225. [2018-10-27 04:48:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-27 04:48:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 247 transitions. [2018-10-27 04:48:03,945 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 247 transitions. Word has length 18 [2018-10-27 04:48:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:03,945 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 247 transitions. [2018-10-27 04:48:03,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 247 transitions. [2018-10-27 04:48:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:48:03,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:03,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:03,948 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:03,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1264524293, now seen corresponding path program 1 times [2018-10-27 04:48:03,949 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:03,949 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:03,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:04,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:04,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:04,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:04,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:04,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:48:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:48:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:48:04,042 INFO L87 Difference]: Start difference. First operand 225 states and 247 transitions. Second operand 4 states. [2018-10-27 04:48:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:04,590 INFO L93 Difference]: Finished difference Result 254 states and 267 transitions. [2018-10-27 04:48:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:48:04,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-27 04:48:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:04,592 INFO L225 Difference]: With dead ends: 254 [2018-10-27 04:48:04,592 INFO L226 Difference]: Without dead ends: 254 [2018-10-27 04:48:04,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-27 04:48:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 222. [2018-10-27 04:48:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 04:48:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2018-10-27 04:48:04,596 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 19 [2018-10-27 04:48:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:04,596 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2018-10-27 04:48:04,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:48:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2018-10-27 04:48:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:48:04,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:04,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:04,598 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:04,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1087047389, now seen corresponding path program 1 times [2018-10-27 04:48:04,602 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:04,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:04,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:04,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:04,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:48:04,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:04,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:04,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-10-27 04:48:04,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:04,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:04,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-27 04:48:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:04,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:04,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:04,771 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand 5 states. [2018-10-27 04:48:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:05,554 INFO L93 Difference]: Finished difference Result 239 states and 253 transitions. [2018-10-27 04:48:05,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:48:05,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-27 04:48:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:05,556 INFO L225 Difference]: With dead ends: 239 [2018-10-27 04:48:05,556 INFO L226 Difference]: Without dead ends: 239 [2018-10-27 04:48:05,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-27 04:48:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-10-27 04:48:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:48:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2018-10-27 04:48:05,561 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 19 [2018-10-27 04:48:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:05,561 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2018-10-27 04:48:05,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2018-10-27 04:48:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:48:05,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:05,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:05,565 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:05,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 661269391, now seen corresponding path program 1 times [2018-10-27 04:48:05,566 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:05,566 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:05,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:05,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:05,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:05,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-27 04:48:05,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:05,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:05,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:05,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:05,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-10-27 04:48:05,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:05,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:05,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:05,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:05,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:12 [2018-10-27 04:48:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:05,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:05,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:05,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:05,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:05,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:05,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:05,831 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand 5 states. [2018-10-27 04:48:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:06,641 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2018-10-27 04:48:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:06,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 04:48:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:06,643 INFO L225 Difference]: With dead ends: 220 [2018-10-27 04:48:06,643 INFO L226 Difference]: Without dead ends: 220 [2018-10-27 04:48:06,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-27 04:48:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-10-27 04:48:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-27 04:48:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2018-10-27 04:48:06,647 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 20 [2018-10-27 04:48:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:06,647 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2018-10-27 04:48:06,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2018-10-27 04:48:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 04:48:06,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:06,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:06,649 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:06,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1138475993, now seen corresponding path program 1 times [2018-10-27 04:48:06,649 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:06,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:06,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:06,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:06,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:06,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:06,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:48:06,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-10-27 04:48:06,937 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:06,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:06,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-10-27 04:48:07,055 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 04:48:07,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:07,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-10-27 04:48:07,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:07,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:48:07,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:07,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-10-27 04:48:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:07,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:07,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:48:07,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:48:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:48:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:48:07,143 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand 9 states. [2018-10-27 04:48:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:10,006 INFO L93 Difference]: Finished difference Result 421 states and 447 transitions. [2018-10-27 04:48:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:48:10,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-10-27 04:48:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:10,008 INFO L225 Difference]: With dead ends: 421 [2018-10-27 04:48:10,008 INFO L226 Difference]: Without dead ends: 421 [2018-10-27 04:48:10,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:48:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-27 04:48:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 219. [2018-10-27 04:48:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-27 04:48:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2018-10-27 04:48:10,013 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 23 [2018-10-27 04:48:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:10,014 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2018-10-27 04:48:10,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:48:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2018-10-27 04:48:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:48:10,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:10,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:10,016 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:10,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -933017325, now seen corresponding path program 1 times [2018-10-27 04:48:10,017 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:10,017 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:10,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:10,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:10,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:48:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:10,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:10,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:10,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:10,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-10-27 04:48:10,249 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:10,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:10,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,289 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:10,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:10,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-27 04:48:10,391 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:48:10,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:10,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,426 INFO L477 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 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:48:10,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:10,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-10-27 04:48:10,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:10,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:10,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:10,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:48:10,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:10,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2018-10-27 04:48:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:10,565 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:10,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:10,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:48:10,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:48:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:48:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:10,568 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand 8 states. [2018-10-27 04:48:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:12,419 INFO L93 Difference]: Finished difference Result 376 states and 398 transitions. [2018-10-27 04:48:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:48:12,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-10-27 04:48:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:12,421 INFO L225 Difference]: With dead ends: 376 [2018-10-27 04:48:12,421 INFO L226 Difference]: Without dead ends: 376 [2018-10-27 04:48:12,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:48:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-27 04:48:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 218. [2018-10-27 04:48:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-27 04:48:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2018-10-27 04:48:12,427 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 24 [2018-10-27 04:48:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:12,427 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2018-10-27 04:48:12,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:48:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2018-10-27 04:48:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:48:12,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:12,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:12,429 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:12,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 38031220, now seen corresponding path program 1 times [2018-10-27 04:48:12,429 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:12,430 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:12,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:12,678 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 04:48:12,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:48:12,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:12,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:48:12,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:12,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:12,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-27 04:48:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:12,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:12,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:48:12,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:48:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:48:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:48:12,750 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand 6 states. [2018-10-27 04:48:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:13,495 INFO L93 Difference]: Finished difference Result 329 states and 357 transitions. [2018-10-27 04:48:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:48:13,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-27 04:48:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:13,496 INFO L225 Difference]: With dead ends: 329 [2018-10-27 04:48:13,496 INFO L226 Difference]: Without dead ends: 329 [2018-10-27 04:48:13,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:48:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-27 04:48:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 222. [2018-10-27 04:48:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 04:48:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2018-10-27 04:48:13,500 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 26 [2018-10-27 04:48:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:13,500 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2018-10-27 04:48:13,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:48:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2018-10-27 04:48:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:48:13,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:13,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:13,502 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:13,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1229811352, now seen corresponding path program 1 times [2018-10-27 04:48:13,506 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:13,506 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:13,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:13,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:13,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:13,791 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-27 04:48:13,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:13,862 INFO L267 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. [2018-10-27 04:48:13,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-10-27 04:48:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:13,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:13,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:13,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:48:13,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:48:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:48:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:48:13,992 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand 6 states. [2018-10-27 04:48:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:14,700 INFO L93 Difference]: Finished difference Result 436 states and 461 transitions. [2018-10-27 04:48:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:48:14,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 04:48:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:14,702 INFO L225 Difference]: With dead ends: 436 [2018-10-27 04:48:14,702 INFO L226 Difference]: Without dead ends: 436 [2018-10-27 04:48:14,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:48:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-27 04:48:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 225. [2018-10-27 04:48:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-27 04:48:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 247 transitions. [2018-10-27 04:48:14,707 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 247 transitions. Word has length 28 [2018-10-27 04:48:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:14,707 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 247 transitions. [2018-10-27 04:48:14,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:48:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 247 transitions. [2018-10-27 04:48:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:48:14,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:14,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:14,709 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash -530553615, now seen corresponding path program 1 times [2018-10-27 04:48:14,709 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:14,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:14,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:14,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:14,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:14,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:14,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:14,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:48:14,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:14,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:14,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-27 04:48:14,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:14,919 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 04:48:14,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:15,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:15,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-10-27 04:48:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:15,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:15,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:15,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:15,163 INFO L87 Difference]: Start difference. First operand 225 states and 247 transitions. Second operand 5 states. [2018-10-27 04:48:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:15,920 INFO L93 Difference]: Finished difference Result 295 states and 312 transitions. [2018-10-27 04:48:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:15,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-10-27 04:48:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:15,922 INFO L225 Difference]: With dead ends: 295 [2018-10-27 04:48:15,922 INFO L226 Difference]: Without dead ends: 295 [2018-10-27 04:48:15,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-27 04:48:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 226. [2018-10-27 04:48:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-27 04:48:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-10-27 04:48:15,926 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 29 [2018-10-27 04:48:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:15,927 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-10-27 04:48:15,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-10-27 04:48:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:48:15,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:15,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:15,929 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:15,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash 732707258, now seen corresponding path program 1 times [2018-10-27 04:48:15,929 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:15,929 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:16,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:16,054 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:16,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:16,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:16,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:16,063 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 5 states. [2018-10-27 04:48:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:16,563 INFO L93 Difference]: Finished difference Result 235 states and 258 transitions. [2018-10-27 04:48:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:16,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-27 04:48:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:16,565 INFO L225 Difference]: With dead ends: 235 [2018-10-27 04:48:16,565 INFO L226 Difference]: Without dead ends: 235 [2018-10-27 04:48:16,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-27 04:48:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2018-10-27 04:48:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 04:48:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 239 transitions. [2018-10-27 04:48:16,568 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 239 transitions. Word has length 30 [2018-10-27 04:48:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:16,568 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 239 transitions. [2018-10-27 04:48:16,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 239 transitions. [2018-10-27 04:48:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:48:16,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:16,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:16,569 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1239088659, now seen corresponding path program 1 times [2018-10-27 04:48:16,570 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:16,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:16,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:16,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:16,703 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:48:16,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:48:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:48:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:48:16,705 INFO L87 Difference]: Start difference. First operand 217 states and 239 transitions. Second operand 6 states. [2018-10-27 04:48:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:17,171 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-10-27 04:48:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:48:17,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:48:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:17,173 INFO L225 Difference]: With dead ends: 278 [2018-10-27 04:48:17,173 INFO L226 Difference]: Without dead ends: 278 [2018-10-27 04:48:17,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:48:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-27 04:48:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 219. [2018-10-27 04:48:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-27 04:48:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-10-27 04:48:17,176 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 31 [2018-10-27 04:48:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:17,176 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-10-27 04:48:17,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:48:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-10-27 04:48:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:48:17,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:17,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:17,186 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:17,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash -242957092, now seen corresponding path program 1 times [2018-10-27 04:48:17,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:17,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:17,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:17,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:17,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-27 04:48:17,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:17,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:17,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-27 04:48:17,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:17,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:17,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:17,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-27 04:48:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:17,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:48:17,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:48:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:48:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:17,404 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 7 states. [2018-10-27 04:48:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:18,182 INFO L93 Difference]: Finished difference Result 286 states and 301 transitions. [2018-10-27 04:48:18,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:48:18,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-27 04:48:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:18,184 INFO L225 Difference]: With dead ends: 286 [2018-10-27 04:48:18,184 INFO L226 Difference]: Without dead ends: 286 [2018-10-27 04:48:18,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:48:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-27 04:48:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 220. [2018-10-27 04:48:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-27 04:48:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2018-10-27 04:48:18,187 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 32 [2018-10-27 04:48:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:18,188 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2018-10-27 04:48:18,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:48:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2018-10-27 04:48:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 04:48:18,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:18,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:18,189 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:18,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1058264885, now seen corresponding path program 1 times [2018-10-27 04:48:18,189 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:18,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:18,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:18,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:18,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-10-27 04:48:18,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:18,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:18,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:18,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:18,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-10-27 04:48:18,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:18,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:18,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:18,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:18,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:18,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-10-27 04:48:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:18,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:18,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:18,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:48:18,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:48:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:48:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:18,915 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 7 states. [2018-10-27 04:48:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:19,556 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2018-10-27 04:48:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:48:19,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-10-27 04:48:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:19,557 INFO L225 Difference]: With dead ends: 276 [2018-10-27 04:48:19,558 INFO L226 Difference]: Without dead ends: 276 [2018-10-27 04:48:19,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:48:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-27 04:48:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 221. [2018-10-27 04:48:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:48:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2018-10-27 04:48:19,561 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 33 [2018-10-27 04:48:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:19,561 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2018-10-27 04:48:19,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:48:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2018-10-27 04:48:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:48:19,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:19,562 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:19,564 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:19,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash 160017087, now seen corresponding path program 1 times [2018-10-27 04:48:19,565 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:19,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:19,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:19,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:19,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:19,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:19,661 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:19,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:19,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:48:19,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:48:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:48:19,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:48:19,663 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand 6 states. [2018-10-27 04:48:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:20,433 INFO L93 Difference]: Finished difference Result 409 states and 434 transitions. [2018-10-27 04:48:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:48:20,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-10-27 04:48:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:20,434 INFO L225 Difference]: With dead ends: 409 [2018-10-27 04:48:20,434 INFO L226 Difference]: Without dead ends: 409 [2018-10-27 04:48:20,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:48:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-27 04:48:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 249. [2018-10-27 04:48:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-27 04:48:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 281 transitions. [2018-10-27 04:48:20,437 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 281 transitions. Word has length 34 [2018-10-27 04:48:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:20,437 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 281 transitions. [2018-10-27 04:48:20,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:48:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 281 transitions. [2018-10-27 04:48:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:48:20,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:20,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:20,438 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:20,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash 665562685, now seen corresponding path program 1 times [2018-10-27 04:48:20,438 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:20,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:20,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:20,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:20,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:20,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:20,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:20,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:20,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:20,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:20,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:20,582 INFO L87 Difference]: Start difference. First operand 249 states and 281 transitions. Second operand 5 states. [2018-10-27 04:48:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:21,202 INFO L93 Difference]: Finished difference Result 303 states and 321 transitions. [2018-10-27 04:48:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:21,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-10-27 04:48:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:21,205 INFO L225 Difference]: With dead ends: 303 [2018-10-27 04:48:21,205 INFO L226 Difference]: Without dead ends: 303 [2018-10-27 04:48:21,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-27 04:48:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 249. [2018-10-27 04:48:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-27 04:48:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2018-10-27 04:48:21,208 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 35 [2018-10-27 04:48:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:21,208 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2018-10-27 04:48:21,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2018-10-27 04:48:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:48:21,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:21,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:21,209 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:21,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash -914689961, now seen corresponding path program 1 times [2018-10-27 04:48:21,209 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:21,209 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:21,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:21,370 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:48:21,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:48:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:48:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:21,373 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand 7 states. [2018-10-27 04:48:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:22,014 INFO L93 Difference]: Finished difference Result 297 states and 314 transitions. [2018-10-27 04:48:22,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:48:22,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-10-27 04:48:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:22,016 INFO L225 Difference]: With dead ends: 297 [2018-10-27 04:48:22,016 INFO L226 Difference]: Without dead ends: 297 [2018-10-27 04:48:22,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:48:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-27 04:48:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 251. [2018-10-27 04:48:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-27 04:48:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2018-10-27 04:48:22,020 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 35 [2018-10-27 04:48:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:22,020 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 282 transitions. [2018-10-27 04:48:22,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:48:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 282 transitions. [2018-10-27 04:48:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:48:22,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:22,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:22,022 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:22,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:22,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1709382432, now seen corresponding path program 1 times [2018-10-27 04:48:22,027 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:22,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:22,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:22,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:22,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 04:48:22,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,306 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:22,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:48:22,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 04:48:22,340 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:22,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:22,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:32 [2018-10-27 04:48:22,469 INFO L477 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 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:48:22,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:22,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2018-10-27 04:48:22,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:22,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:48:22,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:22,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:22,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 04:48:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:22,536 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:48:22,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:48:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:48:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:48:22,538 INFO L87 Difference]: Start difference. First operand 251 states and 282 transitions. Second operand 10 states. [2018-10-27 04:48:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:23,716 INFO L93 Difference]: Finished difference Result 415 states and 441 transitions. [2018-10-27 04:48:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:48:23,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-10-27 04:48:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:23,717 INFO L225 Difference]: With dead ends: 415 [2018-10-27 04:48:23,717 INFO L226 Difference]: Without dead ends: 415 [2018-10-27 04:48:23,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:48:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-27 04:48:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 252. [2018-10-27 04:48:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-27 04:48:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-10-27 04:48:23,720 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 36 [2018-10-27 04:48:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:23,720 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-10-27 04:48:23,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:48:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-10-27 04:48:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:48:23,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:23,721 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:23,721 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:23,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash -342741216, now seen corresponding path program 1 times [2018-10-27 04:48:23,725 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:23,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:23,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:23,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:23,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:23,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:23,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:48:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:48:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:48:23,786 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 3 states. [2018-10-27 04:48:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:23,875 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2018-10-27 04:48:23,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:48:23,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-27 04:48:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:23,877 INFO L225 Difference]: With dead ends: 258 [2018-10-27 04:48:23,877 INFO L226 Difference]: Without dead ends: 258 [2018-10-27 04:48:23,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:48:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-27 04:48:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2018-10-27 04:48:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-27 04:48:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2018-10-27 04:48:23,879 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 37 [2018-10-27 04:48:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:23,879 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2018-10-27 04:48:23,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:48:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2018-10-27 04:48:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:48:23,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:23,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:23,880 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:23,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1451247993, now seen corresponding path program 1 times [2018-10-27 04:48:23,881 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:23,881 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:24,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:24,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:24,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:24,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:24,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:24,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:24,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:24,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-10-27 04:48:24,434 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:24,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:24,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,456 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:24,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:24,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:34 [2018-10-27 04:48:24,531 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:48:24,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:24,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,568 INFO L477 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 0 case distinctions, treesize of input 50 treesize of output 46 [2018-10-27 04:48:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:24,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-10-27 04:48:24,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:24,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:24,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:24,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:48:24,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:24,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-10-27 04:48:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:24,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:24,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:24,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:48:24,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:48:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:48:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:48:24,675 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand 9 states. [2018-10-27 04:48:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:25,835 INFO L93 Difference]: Finished difference Result 279 states and 296 transitions. [2018-10-27 04:48:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:48:25,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-10-27 04:48:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:25,837 INFO L225 Difference]: With dead ends: 279 [2018-10-27 04:48:25,837 INFO L226 Difference]: Without dead ends: 279 [2018-10-27 04:48:25,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:48:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-27 04:48:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 253. [2018-10-27 04:48:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-27 04:48:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 283 transitions. [2018-10-27 04:48:25,839 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 283 transitions. Word has length 37 [2018-10-27 04:48:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:25,840 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 283 transitions. [2018-10-27 04:48:25,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:48:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 283 transitions. [2018-10-27 04:48:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:48:25,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:25,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:25,841 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:25,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -451816370, now seen corresponding path program 1 times [2018-10-27 04:48:25,841 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:25,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:25,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:25,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:25,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:25,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:25,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:25,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:25,974 INFO L87 Difference]: Start difference. First operand 253 states and 283 transitions. Second operand 5 states. [2018-10-27 04:48:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:26,587 INFO L93 Difference]: Finished difference Result 300 states and 315 transitions. [2018-10-27 04:48:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:48:26,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-10-27 04:48:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:26,589 INFO L225 Difference]: With dead ends: 300 [2018-10-27 04:48:26,589 INFO L226 Difference]: Without dead ends: 300 [2018-10-27 04:48:26,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-27 04:48:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 254. [2018-10-27 04:48:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-27 04:48:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 282 transitions. [2018-10-27 04:48:26,591 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 282 transitions. Word has length 43 [2018-10-27 04:48:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:26,592 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 282 transitions. [2018-10-27 04:48:26,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 282 transitions. [2018-10-27 04:48:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:48:26,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:26,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:26,593 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:26,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -835418001, now seen corresponding path program 1 times [2018-10-27 04:48:26,593 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:26,593 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:26,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:26,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:48:26,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:26,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:48:26,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:26,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-10-27 04:48:26,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:26,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:26,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:26,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:26,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:48:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:26,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:26,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:48:26,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:48:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:48:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:26,819 INFO L87 Difference]: Start difference. First operand 254 states and 282 transitions. Second operand 8 states. [2018-10-27 04:48:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:27,902 INFO L93 Difference]: Finished difference Result 365 states and 390 transitions. [2018-10-27 04:48:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:48:27,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-10-27 04:48:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:27,904 INFO L225 Difference]: With dead ends: 365 [2018-10-27 04:48:27,904 INFO L226 Difference]: Without dead ends: 365 [2018-10-27 04:48:27,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:48:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-27 04:48:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 271. [2018-10-27 04:48:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-27 04:48:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 300 transitions. [2018-10-27 04:48:27,908 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 300 transitions. Word has length 43 [2018-10-27 04:48:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:27,908 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 300 transitions. [2018-10-27 04:48:27,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:48:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 300 transitions. [2018-10-27 04:48:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:48:27,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:27,909 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:27,909 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:27,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 366299270, now seen corresponding path program 1 times [2018-10-27 04:48:27,909 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:27,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:28,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:28,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:28,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:28,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:28,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:28,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-27 04:48:28,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,101 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,135 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-10-27 04:48:28,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,193 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,226 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-10-27 04:48:28,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:28,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:28,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:28,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:28,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:48:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:28,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:48:28,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:48:28,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:28,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:48:28,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:48:28,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-10-27 04:48:28,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:48:28,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:28,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:28,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:48:28,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:28,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:48:28,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:48:28,663 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:48:28,688 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:28,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-10-27 04:48:28,700 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,707 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:28,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:28,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:28,739 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-10-27 04:48:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:28,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:48:28,775 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:48:28,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:28,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:28,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:28,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:28,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:28,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:28,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-10-27 04:48:28,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,955 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:28,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:28,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:28,994 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:28,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-10-27 04:48:29,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:29,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:29,080 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:29,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:48:29,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:29,113 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:48:29,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-10-27 04:48:29,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:29,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:29,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:29,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:29,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-27 04:48:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:29,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:48:29,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:48:29,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:29,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:48:29,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:48:29,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-10-27 04:48:29,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:48:29,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:29,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:29,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:29,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:48:29,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:29,607 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:48:29,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:48:29,650 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-10-27 04:48:29,669 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:29,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:48:29,690 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:29,698 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:29,705 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:29,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:29,714 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-10-27 04:48:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:29,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 04:48:29,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 8] total 16 [2018-10-27 04:48:29,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:48:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:48:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:48:29,745 INFO L87 Difference]: Start difference. First operand 271 states and 300 transitions. Second operand 16 states. [2018-10-27 04:48:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:31,632 INFO L93 Difference]: Finished difference Result 342 states and 371 transitions. [2018-10-27 04:48:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:48:31,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-10-27 04:48:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:31,634 INFO L225 Difference]: With dead ends: 342 [2018-10-27 04:48:31,634 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 04:48:31,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:48:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 04:48:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2018-10-27 04:48:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-27 04:48:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 308 transitions. [2018-10-27 04:48:31,640 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 308 transitions. Word has length 46 [2018-10-27 04:48:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:31,640 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 308 transitions. [2018-10-27 04:48:31,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:48:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 308 transitions. [2018-10-27 04:48:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:48:31,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:31,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:31,641 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:31,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1940589609, now seen corresponding path program 1 times [2018-10-27 04:48:31,642 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:31,647 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:31,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:31,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:31,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:31,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:31,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:31,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:31,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:31,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:48:32,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:32,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:32,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:32,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,033 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 04:48:32,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-10-27 04:48:32,087 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:32,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:32,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,118 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:32,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:32,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:41 [2018-10-27 04:48:32,256 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:48:32,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:32,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,306 INFO L477 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 0 case distinctions, treesize of input 50 treesize of output 46 [2018-10-27 04:48:32,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:32,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:37 [2018-10-27 04:48:32,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:32,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:32,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:32,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:48:32,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:32,487 INFO L267 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. [2018-10-27 04:48:32,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:26 [2018-10-27 04:48:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:32,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:32,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:32,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:48:32,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:48:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:48:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:48:32,645 INFO L87 Difference]: Start difference. First operand 279 states and 308 transitions. Second operand 11 states. [2018-10-27 04:48:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:36,199 INFO L93 Difference]: Finished difference Result 502 states and 530 transitions. [2018-10-27 04:48:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:48:36,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-10-27 04:48:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:36,201 INFO L225 Difference]: With dead ends: 502 [2018-10-27 04:48:36,201 INFO L226 Difference]: Without dead ends: 502 [2018-10-27 04:48:36,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:48:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-27 04:48:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 277. [2018-10-27 04:48:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-27 04:48:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 306 transitions. [2018-10-27 04:48:36,207 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 306 transitions. Word has length 46 [2018-10-27 04:48:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:36,208 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 306 transitions. [2018-10-27 04:48:36,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:48:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 306 transitions. [2018-10-27 04:48:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:48:36,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:36,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:36,209 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:36,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash -885075649, now seen corresponding path program 1 times [2018-10-27 04:48:36,210 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:36,210 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:36,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:36,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:48:36,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:48:36,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:36,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:36,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:36,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-27 04:48:36,655 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:48:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:36,751 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:36,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:36,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:36,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:48:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:48:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:48:36,753 INFO L87 Difference]: Start difference. First operand 277 states and 306 transitions. Second operand 4 states. [2018-10-27 04:48:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:37,385 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-10-27 04:48:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:48:37,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-27 04:48:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:37,387 INFO L225 Difference]: With dead ends: 289 [2018-10-27 04:48:37,387 INFO L226 Difference]: Without dead ends: 289 [2018-10-27 04:48:37,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-27 04:48:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2018-10-27 04:48:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-27 04:48:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 305 transitions. [2018-10-27 04:48:37,392 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 305 transitions. Word has length 48 [2018-10-27 04:48:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:37,392 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 305 transitions. [2018-10-27 04:48:37,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:48:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 305 transitions. [2018-10-27 04:48:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:48:37,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:37,393 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:37,394 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:37,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1088428039, now seen corresponding path program 1 times [2018-10-27 04:48:37,394 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:37,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:37,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:48:37,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:48:37,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:48:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:48:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:48:37,452 INFO L87 Difference]: Start difference. First operand 276 states and 305 transitions. Second operand 3 states. [2018-10-27 04:48:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:37,514 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2018-10-27 04:48:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:48:37,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-10-27 04:48:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:37,516 INFO L225 Difference]: With dead ends: 276 [2018-10-27 04:48:37,516 INFO L226 Difference]: Without dead ends: 276 [2018-10-27 04:48:37,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:48:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-27 04:48:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-27 04:48:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-27 04:48:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2018-10-27 04:48:37,519 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 49 [2018-10-27 04:48:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:37,520 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2018-10-27 04:48:37,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:48:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2018-10-27 04:48:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:48:37,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:37,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:37,521 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:37,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1845018040, now seen corresponding path program 1 times [2018-10-27 04:48:37,521 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:37,522 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:37,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:37,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:48:37,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:48:37,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:37,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:37,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-27 04:48:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:37,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:37,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:37,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:37,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:37,848 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand 5 states. [2018-10-27 04:48:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:39,088 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2018-10-27 04:48:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:48:39,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-27 04:48:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:39,090 INFO L225 Difference]: With dead ends: 290 [2018-10-27 04:48:39,090 INFO L226 Difference]: Without dead ends: 290 [2018-10-27 04:48:39,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-27 04:48:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 273. [2018-10-27 04:48:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-27 04:48:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2018-10-27 04:48:39,095 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 49 [2018-10-27 04:48:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:39,096 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2018-10-27 04:48:39,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2018-10-27 04:48:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:48:39,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:39,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:39,097 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:39,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1667541136, now seen corresponding path program 1 times [2018-10-27 04:48:39,098 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:39,098 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:39,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:39,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:48:39,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:48:39,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-27 04:48:39,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:39,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:48:39,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:39,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:39,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-10-27 04:48:39,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:39,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:39,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:39,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-27 04:48:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:39,338 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:39,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:39,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:39,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:39,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:39,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:39,341 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand 5 states. [2018-10-27 04:48:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:40,025 INFO L93 Difference]: Finished difference Result 287 states and 309 transitions. [2018-10-27 04:48:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:48:40,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-27 04:48:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:40,028 INFO L225 Difference]: With dead ends: 287 [2018-10-27 04:48:40,028 INFO L226 Difference]: Without dead ends: 287 [2018-10-27 04:48:40,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:48:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-27 04:48:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 272. [2018-10-27 04:48:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-27 04:48:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2018-10-27 04:48:40,031 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 49 [2018-10-27 04:48:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:40,031 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2018-10-27 04:48:40,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2018-10-27 04:48:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:48:40,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:40,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:40,032 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:40,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:40,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2046227845, now seen corresponding path program 1 times [2018-10-27 04:48:40,033 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:40,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:40,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:40,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:40,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 04:48:40,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:40,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:40,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:48:40,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2018-10-27 04:48:40,405 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:40,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:40,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,438 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:40,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:40,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:49 [2018-10-27 04:48:40,535 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-27 04:48:40,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:40,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,656 INFO L477 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 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:48:40,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:40,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-10-27 04:48:40,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 04:48:40,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-10-27 04:48:40,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:52 [2018-10-27 04:48:40,777 INFO L477 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 23 treesize of output 14 [2018-10-27 04:48:40,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:40,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,805 INFO L477 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 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:48:40,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:40,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-10-27 04:48:40,914 INFO L477 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 80 treesize of output 70 [2018-10-27 04:48:40,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-27 04:48:40,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:40,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 61 treesize of output 65 [2018-10-27 04:48:41,018 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2018-10-27 04:48:41,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:48:41,038 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:48:41,214 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:223, output treesize:105 [2018-10-27 04:48:41,439 INFO L477 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 38 treesize of output 26 [2018-10-27 04:48:41,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 12 [2018-10-27 04:48:41,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:41,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:19 [2018-10-27 04:48:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:41,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:41,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:41,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-27 04:48:41,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:48:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:48:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:48:41,531 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand 16 states. [2018-10-27 04:48:42,294 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-10-27 04:48:42,546 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-10-27 04:48:42,939 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-10-27 04:48:43,147 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-27 04:48:43,613 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-27 04:48:43,943 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-10-27 04:48:44,454 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-10-27 04:48:44,791 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-10-27 04:48:45,387 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-27 04:48:45,651 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-10-27 04:48:46,714 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-10-27 04:48:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:47,765 INFO L93 Difference]: Finished difference Result 490 states and 523 transitions. [2018-10-27 04:48:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:48:47,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-10-27 04:48:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:47,768 INFO L225 Difference]: With dead ends: 490 [2018-10-27 04:48:47,768 INFO L226 Difference]: Without dead ends: 490 [2018-10-27 04:48:47,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 04:48:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-27 04:48:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 298. [2018-10-27 04:48:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-27 04:48:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 330 transitions. [2018-10-27 04:48:47,773 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 330 transitions. Word has length 49 [2018-10-27 04:48:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:47,773 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 330 transitions. [2018-10-27 04:48:47,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:48:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 330 transitions. [2018-10-27 04:48:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 04:48:47,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:47,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:47,774 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:47,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash -154167455, now seen corresponding path program 1 times [2018-10-27 04:48:47,775 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:47,775 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:47,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:47,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:47,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:48:47,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:48:47,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-27 04:48:47,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:47,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-27 04:48:48,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:48,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:48,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:48:48,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:48,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-10-27 04:48:48,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:48,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:48,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:48:48,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:48:48,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:12 [2018-10-27 04:48:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:48,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:48,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:48,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:48:48,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:48:48,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:48:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:48:48,134 INFO L87 Difference]: Start difference. First operand 298 states and 330 transitions. Second operand 5 states. [2018-10-27 04:48:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:48,739 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2018-10-27 04:48:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:48:48,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-10-27 04:48:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:48,742 INFO L225 Difference]: With dead ends: 297 [2018-10-27 04:48:48,742 INFO L226 Difference]: Without dead ends: 297 [2018-10-27 04:48:48,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:48:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-27 04:48:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-10-27 04:48:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-27 04:48:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 329 transitions. [2018-10-27 04:48:48,746 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 329 transitions. Word has length 50 [2018-10-27 04:48:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:48,746 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 329 transitions. [2018-10-27 04:48:48,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:48:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 329 transitions. [2018-10-27 04:48:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 04:48:48,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:48,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:48,747 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:48,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash -991445921, now seen corresponding path program 1 times [2018-10-27 04:48:48,748 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:49,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:49,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:49,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:49,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:49,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:49,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:49,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2018-10-27 04:48:49,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 04:48:49,581 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:49,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:49,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,611 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:49,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:49,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-27 04:48:49,705 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-27 04:48:49,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:49,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,763 INFO L477 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 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:48:49,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:48:49,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:42 [2018-10-27 04:48:49,904 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-10-27 04:48:49,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 04:48:49,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,959 INFO L477 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 0 case distinctions, treesize of input 74 treesize of output 68 [2018-10-27 04:48:49,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 04:48:49,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:76 [2018-10-27 04:48:50,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:50,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 49 treesize of output 43 [2018-10-27 04:48:50,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-10-27 04:48:50,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-27 04:48:50,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:50,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:50,411 INFO L477 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 38 treesize of output 36 [2018-10-27 04:48:50,422 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 04:48:50,423 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:50,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-27 04:48:50,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,457 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:13 [2018-10-27 04:48:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:50,546 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:50,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:50,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-27 04:48:50,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:48:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:48:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:48:50,549 INFO L87 Difference]: Start difference. First operand 297 states and 329 transitions. Second operand 15 states. [2018-10-27 04:48:51,775 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2018-10-27 04:48:52,030 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2018-10-27 04:48:52,398 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-10-27 04:48:52,656 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-10-27 04:48:53,127 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 04:48:53,332 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 04:48:53,903 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 04:48:54,501 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-10-27 04:48:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:57,105 INFO L93 Difference]: Finished difference Result 553 states and 601 transitions. [2018-10-27 04:48:57,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:48:57,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-27 04:48:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:57,109 INFO L225 Difference]: With dead ends: 553 [2018-10-27 04:48:57,109 INFO L226 Difference]: Without dead ends: 553 [2018-10-27 04:48:57,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 04:48:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-10-27 04:48:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 329. [2018-10-27 04:48:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-27 04:48:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 364 transitions. [2018-10-27 04:48:57,114 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 364 transitions. Word has length 50 [2018-10-27 04:48:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:57,114 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 364 transitions. [2018-10-27 04:48:57,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:48:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 364 transitions. [2018-10-27 04:48:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:48:57,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:57,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:57,115 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:57,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1401296899, now seen corresponding path program 1 times [2018-10-27 04:48:57,116 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:57,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:57,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:57,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:57,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:57,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:48:57,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:48:57,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:48:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:48:57,381 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:48:57,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:57,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:48:57,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:48:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:48:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:48:57,384 INFO L87 Difference]: Start difference. First operand 329 states and 364 transitions. Second operand 9 states. [2018-10-27 04:48:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:58,666 INFO L93 Difference]: Finished difference Result 402 states and 429 transitions. [2018-10-27 04:48:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 04:48:58,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-10-27 04:48:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:58,670 INFO L225 Difference]: With dead ends: 402 [2018-10-27 04:48:58,670 INFO L226 Difference]: Without dead ends: 402 [2018-10-27 04:48:58,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:48:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-27 04:48:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 313. [2018-10-27 04:48:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-27 04:48:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 344 transitions. [2018-10-27 04:48:58,683 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 344 transitions. Word has length 52 [2018-10-27 04:48:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:58,683 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 344 transitions. [2018-10-27 04:48:58,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:48:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 344 transitions. [2018-10-27 04:48:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:48:58,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:58,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:58,690 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:58,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1482402892, now seen corresponding path program 1 times [2018-10-27 04:48:58,691 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:48:58,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:48:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:59,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:59,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:48:59,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 04:48:59,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:59,194 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:59,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:48:59,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 04:48:59,256 INFO L477 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 11 treesize of output 8 [2018-10-27 04:48:59,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:48:59,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:32 [2018-10-27 04:48:59,335 INFO L477 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 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:48:59,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:48:59,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2018-10-27 04:48:59,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:48:59,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:48:59,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:59,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 04:48:59,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:59,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:59,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:59,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-10-27 04:48:59,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,510 INFO L267 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. [2018-10-27 04:48:59,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:38 [2018-10-27 04:48:59,561 INFO L477 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 13 treesize of output 10 [2018-10-27 04:48:59,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-10-27 04:48:59,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:59,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:56 [2018-10-27 04:49:00,063 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 04:49:00,152 INFO L477 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 47 treesize of output 43 [2018-10-27 04:49:00,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:00,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:00,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:44 [2018-10-27 04:49:00,397 INFO L477 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 33 treesize of output 25 [2018-10-27 04:49:00,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 14 [2018-10-27 04:49:00,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:00,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:30 [2018-10-27 04:49:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:00,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-27 04:49:00,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:49:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:49:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:49:00,471 INFO L87 Difference]: Start difference. First operand 313 states and 344 transitions. Second operand 15 states. [2018-10-27 04:49:01,757 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-27 04:49:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:04,564 INFO L93 Difference]: Finished difference Result 560 states and 593 transitions. [2018-10-27 04:49:04,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:49:04,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-10-27 04:49:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:04,568 INFO L225 Difference]: With dead ends: 560 [2018-10-27 04:49:04,568 INFO L226 Difference]: Without dead ends: 560 [2018-10-27 04:49:04,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:49:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-27 04:49:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 329. [2018-10-27 04:49:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-27 04:49:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 361 transitions. [2018-10-27 04:49:04,573 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 361 transitions. Word has length 53 [2018-10-27 04:49:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:04,574 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 361 transitions. [2018-10-27 04:49:04,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:49:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2018-10-27 04:49:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:49:04,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:04,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:04,577 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:04,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1290150821, now seen corresponding path program 1 times [2018-10-27 04:49:04,577 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:04,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:05,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:05,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:05,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:49:05,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 04:49:05,282 INFO L477 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 11 treesize of output 8 [2018-10-27 04:49:05,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:05,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:32 [2018-10-27 04:49:05,489 INFO L477 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 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:49:05,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:05,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2018-10-27 04:49:05,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:05,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:49:05,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:05,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 04:49:05,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:05,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-10-27 04:49:05,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-10-27 04:49:05,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:21 [2018-10-27 04:49:05,947 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:49:05,995 INFO L477 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 13 treesize of output 10 [2018-10-27 04:49:06,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:06,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,236 INFO L477 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 13 treesize of output 10 [2018-10-27 04:49:06,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:06,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:41 [2018-10-27 04:49:06,378 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:49:06,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:06,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,417 INFO L477 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 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:49:06,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:06,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-10-27 04:49:06,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:06,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:49:06,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:06,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:49:06,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:06,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2018-10-27 04:49:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:06,552 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:06,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:06,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-27 04:49:06,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:49:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:49:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:49:06,555 INFO L87 Difference]: Start difference. First operand 329 states and 361 transitions. Second operand 14 states. [2018-10-27 04:49:08,218 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-10-27 04:49:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:10,340 INFO L93 Difference]: Finished difference Result 568 states and 601 transitions. [2018-10-27 04:49:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:49:10,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-27 04:49:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:10,344 INFO L225 Difference]: With dead ends: 568 [2018-10-27 04:49:10,344 INFO L226 Difference]: Without dead ends: 568 [2018-10-27 04:49:10,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:49:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-27 04:49:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 330. [2018-10-27 04:49:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-27 04:49:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 362 transitions. [2018-10-27 04:49:10,349 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 362 transitions. Word has length 54 [2018-10-27 04:49:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:10,350 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 362 transitions. [2018-10-27 04:49:10,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:49:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 362 transitions. [2018-10-27 04:49:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 04:49:10,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:10,351 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:10,351 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:10,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1289731668, now seen corresponding path program 1 times [2018-10-27 04:49:10,352 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:10,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:10,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:10,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:10,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:49:10,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:10,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:10,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:10,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-27 04:49:10,706 INFO L477 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 13 treesize of output 10 [2018-10-27 04:49:10,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-10-27 04:49:10,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-10-27 04:49:10,780 INFO L477 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 44 treesize of output 38 [2018-10-27 04:49:10,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:10,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2018-10-27 04:49:10,821 INFO L477 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 44 treesize of output 38 [2018-10-27 04:49:10,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:10,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-10-27 04:49:10,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:10,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2018-10-27 04:49:10,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:10,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:1 [2018-10-27 04:49:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:49:10,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:10,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:10,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:49:10,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:49:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:49:10,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:49:10,915 INFO L87 Difference]: Start difference. First operand 330 states and 362 transitions. Second operand 9 states. [2018-10-27 04:49:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:12,383 INFO L93 Difference]: Finished difference Result 419 states and 455 transitions. [2018-10-27 04:49:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:49:12,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-27 04:49:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:12,386 INFO L225 Difference]: With dead ends: 419 [2018-10-27 04:49:12,386 INFO L226 Difference]: Without dead ends: 419 [2018-10-27 04:49:12,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:49:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-27 04:49:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 313. [2018-10-27 04:49:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-27 04:49:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 343 transitions. [2018-10-27 04:49:12,390 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 343 transitions. Word has length 54 [2018-10-27 04:49:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:12,391 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 343 transitions. [2018-10-27 04:49:12,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:49:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 343 transitions. [2018-10-27 04:49:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:49:12,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:12,391 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:12,392 INFO L424 AbstractCegarLoop]: === Iteration 42 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:12,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 557890212, now seen corresponding path program 1 times [2018-10-27 04:49:12,392 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:12,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:12,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:49:12,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:12,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:49:12,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:12,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-27 04:49:12,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:12,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:12,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:12,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:12,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:12,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-27 04:49:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:12,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:12,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:49:12,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:49:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:49:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:49:12,637 INFO L87 Difference]: Start difference. First operand 313 states and 343 transitions. Second operand 6 states. [2018-10-27 04:49:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:13,491 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2018-10-27 04:49:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:49:13,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-10-27 04:49:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:13,495 INFO L225 Difference]: With dead ends: 334 [2018-10-27 04:49:13,495 INFO L226 Difference]: Without dead ends: 334 [2018-10-27 04:49:13,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:49:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-27 04:49:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 318. [2018-10-27 04:49:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-27 04:49:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 348 transitions. [2018-10-27 04:49:13,499 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 348 transitions. Word has length 55 [2018-10-27 04:49:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:13,499 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 348 transitions. [2018-10-27 04:49:13,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:49:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 348 transitions. [2018-10-27 04:49:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:49:13,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:13,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:13,501 INFO L424 AbstractCegarLoop]: === Iteration 43 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1218255276, now seen corresponding path program 1 times [2018-10-27 04:49:13,501 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:13,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:13,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:13,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:13,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:13,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:14,014 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:14,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:14,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:14,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2018-10-27 04:49:14,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 04:49:14,268 INFO L477 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 13 treesize of output 10 [2018-10-27 04:49:14,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:14,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,299 INFO L477 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 13 treesize of output 10 [2018-10-27 04:49:14,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:14,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-27 04:49:14,402 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-27 04:49:14,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:14,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,456 INFO L477 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 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:49:14,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:14,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:42 [2018-10-27 04:49:14,516 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-27 04:49:14,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:14,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,563 INFO L477 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 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:49:14,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:49:14,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:80, output treesize:34 [2018-10-27 04:49:14,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:14,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:14,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:14,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:49:14,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:14,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-10-27 04:49:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:14,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:14,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:49:14,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:49:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:49:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:49:14,776 INFO L87 Difference]: Start difference. First operand 318 states and 348 transitions. Second operand 11 states. [2018-10-27 04:49:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:17,696 INFO L93 Difference]: Finished difference Result 430 states and 459 transitions. [2018-10-27 04:49:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:49:17,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-10-27 04:49:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:17,700 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:49:17,701 INFO L226 Difference]: Without dead ends: 430 [2018-10-27 04:49:17,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:49:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-27 04:49:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 318. [2018-10-27 04:49:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-27 04:49:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 347 transitions. [2018-10-27 04:49:17,705 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 347 transitions. Word has length 55 [2018-10-27 04:49:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:17,706 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 347 transitions. [2018-10-27 04:49:17,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:49:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 347 transitions. [2018-10-27 04:49:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:49:17,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:17,706 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:17,707 INFO L424 AbstractCegarLoop]: === Iteration 44 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:17,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1900092904, now seen corresponding path program 1 times [2018-10-27 04:49:17,707 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:17,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:17,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:17,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:17,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:17,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:17,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:17,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:17,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-10-27 04:49:17,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:49:18,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:18,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:49:18,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:18,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-10-27 04:49:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:18,067 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:18,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:18,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:49:18,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:49:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:49:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:49:18,070 INFO L87 Difference]: Start difference. First operand 318 states and 347 transitions. Second operand 6 states. [2018-10-27 04:49:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:18,787 INFO L93 Difference]: Finished difference Result 337 states and 367 transitions. [2018-10-27 04:49:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:49:18,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-27 04:49:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:18,791 INFO L225 Difference]: With dead ends: 337 [2018-10-27 04:49:18,791 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 04:49:18,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:49:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 04:49:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2018-10-27 04:49:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-27 04:49:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 351 transitions. [2018-10-27 04:49:18,798 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 351 transitions. Word has length 56 [2018-10-27 04:49:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:18,799 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 351 transitions. [2018-10-27 04:49:18,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:49:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 351 transitions. [2018-10-27 04:49:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:49:18,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:18,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:18,800 INFO L424 AbstractCegarLoop]: === Iteration 45 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:18,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1420340019, now seen corresponding path program 1 times [2018-10-27 04:49:18,800 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:18,800 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:18,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:18,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:18,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:18,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:19,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:19,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 04:49:19,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:19,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:19,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:19,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:19,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:49:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:19,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:19,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:19,447 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:19,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:19,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:19,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:19,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:19,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:19,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:19,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-10-27 04:49:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:19,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:19,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:19,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:19,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:19,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-27 04:49:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:19,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:19,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 04:49:19,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10, 9] total 20 [2018-10-27 04:49:19,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:49:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:49:19,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:49:19,781 INFO L87 Difference]: Start difference. First operand 322 states and 351 transitions. Second operand 20 states. [2018-10-27 04:49:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:22,368 INFO L93 Difference]: Finished difference Result 431 states and 449 transitions. [2018-10-27 04:49:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 04:49:22,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-10-27 04:49:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:22,371 INFO L225 Difference]: With dead ends: 431 [2018-10-27 04:49:22,372 INFO L226 Difference]: Without dead ends: 431 [2018-10-27 04:49:22,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 04:49:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-27 04:49:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 336. [2018-10-27 04:49:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-27 04:49:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 367 transitions. [2018-10-27 04:49:22,377 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 367 transitions. Word has length 58 [2018-10-27 04:49:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:22,377 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 367 transitions. [2018-10-27 04:49:22,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:49:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 367 transitions. [2018-10-27 04:49:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:49:22,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:22,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:22,378 INFO L424 AbstractCegarLoop]: === Iteration 46 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:22,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -992044948, now seen corresponding path program 1 times [2018-10-27 04:49:22,379 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:22,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:22,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:22,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:22,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:22,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:22,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:22,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:22,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:22,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 04:49:22,854 INFO L477 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 11 treesize of output 8 [2018-10-27 04:49:22,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:22,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:27 [2018-10-27 04:49:22,926 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 04:49:22,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:22,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-10-27 04:49:22,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:22,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:49:22,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:22,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:23,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:23,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:12 [2018-10-27 04:49:23,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:23,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:23,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-27 04:49:23,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:23,290 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-10-27 04:49:23,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:23,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:23,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-10-27 04:49:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:23,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:24,112 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 04:49:24,312 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-10-27 04:49:24,800 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 04:49:24,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:24,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:24,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-27 04:49:24,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:24,915 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:24,916 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:24,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-10-27 04:49:24,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:25,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:25,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:91 [2018-10-27 04:49:25,225 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 04:49:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:25,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:49:25,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2018-10-27 04:49:25,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:49:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:49:25,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:49:25,264 INFO L87 Difference]: Start difference. First operand 336 states and 367 transitions. Second operand 20 states. [2018-10-27 04:49:26,644 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-10-27 04:49:29,649 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-10-27 04:49:29,901 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-10-27 04:49:34,359 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-10-27 04:49:36,892 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-10-27 04:49:37,454 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-27 04:49:37,845 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-10-27 04:49:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:39,289 INFO L93 Difference]: Finished difference Result 354 states and 374 transitions. [2018-10-27 04:49:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:49:39,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-10-27 04:49:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:39,292 INFO L225 Difference]: With dead ends: 354 [2018-10-27 04:49:39,292 INFO L226 Difference]: Without dead ends: 354 [2018-10-27 04:49:39,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:49:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-27 04:49:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 335. [2018-10-27 04:49:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-27 04:49:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 366 transitions. [2018-10-27 04:49:39,296 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 366 transitions. Word has length 58 [2018-10-27 04:49:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:39,297 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 366 transitions. [2018-10-27 04:49:39,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:49:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 366 transitions. [2018-10-27 04:49:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 04:49:39,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:39,297 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:39,298 INFO L424 AbstractCegarLoop]: === Iteration 47 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1080866297, now seen corresponding path program 1 times [2018-10-27 04:49:39,299 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:39,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:39,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:39,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:49:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:39,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:39,780 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~list~0.base_26 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_main_~list~0.base_26))) (= (store |c_#valid| v_main_~list~0.base_26 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-10-27 04:49:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:39,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:39,791 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:39,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:39,924 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base)) (= |c_#valid| (store |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base (_ bv0 1))))) is different from true [2018-10-27 04:49:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-10-27 04:49:39,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:39,954 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_5| (_ BitVec 32))) (or (= (store |c_#valid| |v_main_#t~malloc0.base_5| (_ bv0 1)) |c_old(#valid)|) (not (= (_ bv0 1) (select |c_#valid| |v_main_#t~malloc0.base_5|))))) is different from false [2018-10-27 04:49:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:40,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 04:49:40,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 10 [2018-10-27 04:49:40,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:49:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:49:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=41, Unknown=3, NotChecked=42, Total=110 [2018-10-27 04:49:40,007 INFO L87 Difference]: Start difference. First operand 335 states and 366 transitions. Second operand 11 states. [2018-10-27 04:49:40,023 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_main_~list~0.base_26 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_main_~list~0.base_26))) (= (store |c_#valid| v_main_~list~0.base_26 (_ bv0 1)) |c_old(#valid)|))) (forall ((|v_main_#t~malloc0.base_5| (_ BitVec 32))) (or (= (store |c_#valid| |v_main_#t~malloc0.base_5| (_ bv0 1)) |c_old(#valid)|) (not (= (_ bv0 1) (select |c_#valid| |v_main_#t~malloc0.base_5|))))) (= |c_#valid| |c_old(#valid)|) (= (_ bv0 1) (select |c_old(#valid)| (_ bv0 32)))) is different from false [2018-10-27 04:49:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:40,656 INFO L93 Difference]: Finished difference Result 344 states and 374 transitions. [2018-10-27 04:49:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:49:40,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-10-27 04:49:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:40,659 INFO L225 Difference]: With dead ends: 344 [2018-10-27 04:49:40,659 INFO L226 Difference]: Without dead ends: 312 [2018-10-27 04:49:40,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=52, Unknown=4, NotChecked=68, Total=156 [2018-10-27 04:49:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-27 04:49:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-10-27 04:49:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-27 04:49:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 342 transitions. [2018-10-27 04:49:40,663 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 342 transitions. Word has length 59 [2018-10-27 04:49:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:40,663 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 342 transitions. [2018-10-27 04:49:40,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:49:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 342 transitions. [2018-10-27 04:49:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 04:49:40,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:40,664 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:40,664 INFO L424 AbstractCegarLoop]: === Iteration 48 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:40,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash 127549134, now seen corresponding path program 1 times [2018-10-27 04:49:40,664 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:40,665 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:40,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:40,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:41,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:41,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:41,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:41,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:41,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:41,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2018-10-27 04:49:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:41,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:41,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:41,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:49:41,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:49:41,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:49:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:49:41,155 INFO L87 Difference]: Start difference. First operand 312 states and 342 transitions. Second operand 8 states. [2018-10-27 04:49:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:42,010 INFO L93 Difference]: Finished difference Result 318 states and 349 transitions. [2018-10-27 04:49:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:49:42,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-27 04:49:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:42,014 INFO L225 Difference]: With dead ends: 318 [2018-10-27 04:49:42,014 INFO L226 Difference]: Without dead ends: 318 [2018-10-27 04:49:42,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:49:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-27 04:49:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 311. [2018-10-27 04:49:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-27 04:49:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-10-27 04:49:42,020 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 60 [2018-10-27 04:49:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:42,020 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-10-27 04:49:42,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:49:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-10-27 04:49:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 04:49:42,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:42,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:42,022 INFO L424 AbstractCegarLoop]: === Iteration 49 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:42,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash -340943999, now seen corresponding path program 1 times [2018-10-27 04:49:42,022 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:42,022 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:42,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:42,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:42,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:42,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:42,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:42,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-27 04:49:42,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:42,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 04:49:42,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:42,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:42,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-10-27 04:49:42,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:42,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:49:42,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-27 04:49:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:42,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:49:42,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:49:42,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:49:42,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:49:42,337 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 5 states. [2018-10-27 04:49:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:43,100 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-10-27 04:49:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:49:43,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-10-27 04:49:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:43,104 INFO L225 Difference]: With dead ends: 325 [2018-10-27 04:49:43,104 INFO L226 Difference]: Without dead ends: 325 [2018-10-27 04:49:43,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:49:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-27 04:49:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 310. [2018-10-27 04:49:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-27 04:49:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 340 transitions. [2018-10-27 04:49:43,108 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 340 transitions. Word has length 61 [2018-10-27 04:49:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:43,108 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 340 transitions. [2018-10-27 04:49:43,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:49:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 340 transitions. [2018-10-27 04:49:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:49:43,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:43,109 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:43,109 INFO L424 AbstractCegarLoop]: === Iteration 50 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:43,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1979329232, now seen corresponding path program 1 times [2018-10-27 04:49:43,110 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:43,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:43,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:43,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:43,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:43,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:43,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:43,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:1 [2018-10-27 04:49:43,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:43,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-27 04:49:43,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:43,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:43,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:43,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:43,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-10-27 04:49:43,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:43,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:49:43,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:43,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:49:43,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:43,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-10-27 04:49:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:49:43,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:43,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:43,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:49:43,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:49:43,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:49:43,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:49:43,499 INFO L87 Difference]: Start difference. First operand 310 states and 340 transitions. Second operand 5 states. [2018-10-27 04:49:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:44,046 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2018-10-27 04:49:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:49:44,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-10-27 04:49:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:44,048 INFO L225 Difference]: With dead ends: 309 [2018-10-27 04:49:44,048 INFO L226 Difference]: Without dead ends: 309 [2018-10-27 04:49:44,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:49:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-27 04:49:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-10-27 04:49:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-27 04:49:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 339 transitions. [2018-10-27 04:49:44,056 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 339 transitions. Word has length 62 [2018-10-27 04:49:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:44,056 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 339 transitions. [2018-10-27 04:49:44,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:49:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 339 transitions. [2018-10-27 04:49:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 04:49:44,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:44,057 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:44,057 INFO L424 AbstractCegarLoop]: === Iteration 51 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:44,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash 535124882, now seen corresponding path program 1 times [2018-10-27 04:49:44,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:44,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:44,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:44,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:44,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:44,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:44,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:44,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:44,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2018-10-27 04:49:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:44,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:49:44,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:49:44,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:49:44,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:49:44,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:49:44,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:49:44,532 INFO L87 Difference]: Start difference. First operand 309 states and 339 transitions. Second operand 9 states. [2018-10-27 04:49:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:46,071 INFO L93 Difference]: Finished difference Result 318 states and 349 transitions. [2018-10-27 04:49:46,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:49:46,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-27 04:49:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:46,074 INFO L225 Difference]: With dead ends: 318 [2018-10-27 04:49:46,074 INFO L226 Difference]: Without dead ends: 318 [2018-10-27 04:49:46,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:49:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-27 04:49:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2018-10-27 04:49:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-27 04:49:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 338 transitions. [2018-10-27 04:49:46,078 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 338 transitions. Word has length 64 [2018-10-27 04:49:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:46,078 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 338 transitions. [2018-10-27 04:49:46,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:49:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 338 transitions. [2018-10-27 04:49:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 04:49:46,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:46,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:46,079 INFO L424 AbstractCegarLoop]: === Iteration 52 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:46,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash -590997691, now seen corresponding path program 1 times [2018-10-27 04:49:46,080 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:49:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:49:46,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:46,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:46,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:46,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:46,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:46,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:49:46,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-10-27 04:49:46,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:46,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:46,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:49:46,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-27 04:49:46,585 INFO L477 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 11 treesize of output 8 [2018-10-27 04:49:46,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:46,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:29 [2018-10-27 04:49:46,653 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 04:49:46,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:46,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2018-10-27 04:49:46,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:46,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:49:46,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:46,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-10-27 04:49:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:46,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:47,110 INFO L477 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 0 case distinctions, treesize of input 45 treesize of output 38 [2018-10-27 04:49:47,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:47,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,192 INFO L477 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 23 treesize of output 22 [2018-10-27 04:49:47,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:47,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-27 04:49:47,205 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,218 INFO L477 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 27 treesize of output 26 [2018-10-27 04:49:47,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:47,243 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-27 04:49:47,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,323 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:47,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:47,331 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:47,343 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,350 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,355 INFO L477 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 27 treesize of output 24 [2018-10-27 04:49:47,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:47,358 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2018-10-27 04:49:47,368 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,374 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:47,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:47,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 69 [2018-10-27 04:49:47,825 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-10-27 04:49:47,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 04:49:47,829 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-10-27 04:49:47,833 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-10-27 04:49:47,837 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:47,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:47,841 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:49:48,127 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 41 [2018-10-27 04:49:48,148 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:48,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:49:48,152 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,157 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-10-27 04:49:48,158 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,446 INFO L477 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 29 treesize of output 25 [2018-10-27 04:49:48,459 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:48,460 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,481 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:49:48,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2018-10-27 04:49:48,499 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,522 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,525 INFO L477 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 25 treesize of output 21 [2018-10-27 04:49:48,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:48,540 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,562 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:49:48,572 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-10-27 04:49:48,572 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,586 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,916 INFO L477 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 24 treesize of output 26 [2018-10-27 04:49:48,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:49:48,931 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:48,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2018-10-27 04:49:48,966 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:48,997 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:49,016 INFO L477 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 35 treesize of output 37 [2018-10-27 04:49:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:49,020 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:49,063 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-10-27 04:49:49,064 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,082 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,098 INFO L477 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 28 treesize of output 30 [2018-10-27 04:49:49,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-27 04:49:49,102 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,137 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-10-27 04:49:49,138 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:49,166 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:49,182 INFO L477 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 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-27 04:49:49,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:49:49,200 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:49,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-10-27 04:49:49,236 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,268 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:49,525 INFO L477 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 24 treesize of output 20 [2018-10-27 04:49:49,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:49,528 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2018-10-27 04:49:49,540 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,559 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:49:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:49,568 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:49,579 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,590 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 25 [2018-10-27 04:49:49,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:49,598 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-10-27 04:49:49,614 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,625 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,863 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-10-27 04:49:49,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-10-27 04:49:50,046 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-27 04:49:50,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 04:49:50,050 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:50,054 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:50,060 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:50,095 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 33 treesize of output 34 [2018-10-27 04:49:50,368 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-10-27 04:49:50,374 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,381 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-10-27 04:49:50,381 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-10-27 04:49:50,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-27 04:49:50,615 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,627 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,630 INFO L477 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 30 treesize of output 26 [2018-10-27 04:49:50,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-10-27 04:49:50,635 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,647 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,650 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:49:50,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-10-27 04:49:50,655 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,667 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,884 INFO L477 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 33 treesize of output 33 [2018-10-27 04:49:50,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 17 [2018-10-27 04:49:50,889 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-10-27 04:49:50,927 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:50,955 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:50,974 INFO L477 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 29 treesize of output 31 [2018-10-27 04:49:50,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-10-27 04:49:50,981 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 [2018-10-27 04:49:51,016 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,043 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:51,061 INFO L477 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 36 [2018-10-27 04:49:51,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-10-27 04:49:51,064 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-10-27 04:49:51,104 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,120 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,272 INFO L477 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 31 treesize of output 25 [2018-10-27 04:49:51,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:51,276 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 04:49:51,293 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,307 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,312 INFO L477 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 27 treesize of output 23 [2018-10-27 04:49:51,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:49:51,317 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2018-10-27 04:49:51,333 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,346 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,474 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-10-27 04:49:51,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-10-27 04:49:51,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:51,520 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,553 INFO L477 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 18 treesize of output 18 [2018-10-27 04:49:51,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-27 04:49:51,556 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,564 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:51,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:51,570 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,578 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,603 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:52,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 31 dim-0 vars, and 28 xjuncts. [2018-10-27 04:49:52,225 INFO L202 ElimStorePlain]: Needed 88 recursive calls to eliminate 3 variables, input treesize:59, output treesize:384 [2018-10-27 04:49:52,385 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 34 [2018-10-27 04:49:52,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:52,459 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:52,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:52,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-10-27 04:49:52,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2018-10-27 04:49:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:52,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:52,488 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:52,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:52,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:52,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:52,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:49:52,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-27 04:49:52,588 INFO L477 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 11 treesize of output 8 [2018-10-27 04:49:52,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:52,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:29 [2018-10-27 04:49:52,631 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 04:49:52,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:49:52,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2018-10-27 04:49:52,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:52,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:49:52,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:52,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-10-27 04:49:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:52,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:52,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 04:49:52,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:52,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,895 INFO L477 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 20 treesize of output 20 [2018-10-27 04:49:52,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-10-27 04:49:52,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:52,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:52,912 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:52,965 INFO L477 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 0 case distinctions, treesize of input 47 treesize of output 40 [2018-10-27 04:49:53,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:53,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,052 INFO L477 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 25 treesize of output 22 [2018-10-27 04:49:53,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:53,056 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2018-10-27 04:49:53,067 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,074 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,082 INFO L477 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 25 treesize of output 24 [2018-10-27 04:49:53,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:53,086 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:53,100 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,109 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:53,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:53,119 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:53,138 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,148 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,156 INFO L477 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 21 treesize of output 20 [2018-10-27 04:49:53,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:53,161 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2018-10-27 04:49:53,174 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,183 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:53,229 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:53,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 69 [2018-10-27 04:49:53,796 WARN L179 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-10-27 04:49:53,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:53,800 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-10-27 04:49:53,803 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-10-27 04:49:53,807 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-27 04:49:53,811 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:54,094 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 41 [2018-10-27 04:49:54,112 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:54,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:49:54,116 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,121 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-10-27 04:49:54,122 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,409 INFO L477 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 26 treesize of output 28 [2018-10-27 04:49:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-27 04:49:54,412 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:54,441 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:49:54,442 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,468 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:54,486 INFO L477 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 24 treesize of output 26 [2018-10-27 04:49:54,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2018-10-27 04:49:54,490 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:54,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:49:54,525 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,555 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:54,569 INFO L477 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 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-27 04:49:54,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-10-27 04:49:54,572 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:54,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:49:54,612 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,639 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:54,654 INFO L477 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 33 treesize of output 35 [2018-10-27 04:49:54,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:54,660 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-10-27 04:49:54,661 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,684 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:49:54,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2018-10-27 04:49:54,949 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,970 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,973 INFO L477 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 25 treesize of output 21 [2018-10-27 04:49:54,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:54,984 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:55,002 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:55,004 INFO L477 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 31 treesize of output 27 [2018-10-27 04:49:55,015 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:49:55,016 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:55,033 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:55,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 25 [2018-10-27 04:49:55,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:55,249 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 04:49:55,263 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,274 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,279 INFO L477 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 26 treesize of output 22 [2018-10-27 04:49:55,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:55,307 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:49:55,334 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,343 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,348 INFO L477 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 24 treesize of output 20 [2018-10-27 04:49:55,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2018-10-27 04:49:55,351 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:55,366 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,376 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:55,591 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-10-27 04:49:55,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-10-27 04:49:55,792 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-27 04:49:55,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 04:49:55,796 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:49:55,800 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-10-27 04:49:55,803 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-10-27 04:49:55,808 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 33 treesize of output 34 [2018-10-27 04:49:56,087 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,094 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-10-27 04:49:56,094 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-10-27 04:49:56,099 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,358 INFO L477 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 34 treesize of output 30 [2018-10-27 04:49:56,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:56,362 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:56,381 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,395 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,403 INFO L477 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 29 treesize of output 25 [2018-10-27 04:49:56,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:56,407 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2018-10-27 04:49:56,423 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,438 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,443 INFO L477 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 33 treesize of output 27 [2018-10-27 04:49:56,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:49:56,447 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2018-10-27 04:49:56,463 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,475 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,688 INFO L477 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 30 treesize of output 26 [2018-10-27 04:49:56,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-10-27 04:49:56,694 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,707 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,710 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:49:56,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-10-27 04:49:56,716 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,729 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:49:56,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-27 04:49:56,741 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,752 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,925 INFO L477 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 31 treesize of output 31 [2018-10-27 04:49:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 [2018-10-27 04:49:56,930 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-10-27 04:49:56,961 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,984 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:57,001 INFO L477 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 27 treesize of output 29 [2018-10-27 04:49:57,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 15 [2018-10-27 04:49:57,005 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:57,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-10-27 04:49:57,040 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:57,075 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:57,200 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-10-27 04:49:57,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 31 dim-0 vars, and 28 xjuncts. [2018-10-27 04:49:57,796 INFO L202 ElimStorePlain]: Needed 85 recursive calls to eliminate 3 variables, input treesize:59, output treesize:372 [2018-10-27 04:49:57,890 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:57,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:57,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:57,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-10-27 04:49:57,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:57,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:57,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2018-10-27 04:49:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:49:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 04:49:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 14 [2018-10-27 04:49:57,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:49:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:49:57,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:49:57,934 INFO L87 Difference]: Start difference. First operand 308 states and 338 transitions. Second operand 15 states. [2018-10-27 04:50:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:00,372 INFO L93 Difference]: Finished difference Result 456 states and 496 transitions. [2018-10-27 04:50:00,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:50:00,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-10-27 04:50:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:00,376 INFO L225 Difference]: With dead ends: 456 [2018-10-27 04:50:00,376 INFO L226 Difference]: Without dead ends: 456 [2018-10-27 04:50:00,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:50:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-27 04:50:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 307. [2018-10-27 04:50:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-27 04:50:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 337 transitions. [2018-10-27 04:50:00,381 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 337 transitions. Word has length 65 [2018-10-27 04:50:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:00,381 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 337 transitions. [2018-10-27 04:50:00,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:50:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 337 transitions. [2018-10-27 04:50:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-27 04:50:00,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:00,382 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:00,383 INFO L424 AbstractCegarLoop]: === Iteration 53 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:50:00,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1141059084, now seen corresponding path program 1 times [2018-10-27 04:50:00,384 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:00,384 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:00,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:00,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:00,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:50:00,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:50:00,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 04:50:00,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 04:50:00,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-10-27 04:50:01,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:01,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:01,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:50:01,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 04:50:01,073 INFO L477 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 11 treesize of output 8 [2018-10-27 04:50:01,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:01,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,103 INFO L477 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 11 treesize of output 8 [2018-10-27 04:50:01,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:01,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2018-10-27 04:50:01,189 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:50:01,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:50:01,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,235 INFO L477 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 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:50:01,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:50:01,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-10-27 04:50:01,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:50:01,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:50:01,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:50:01,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:50:01,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2018-10-27 04:50:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:01,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:02,031 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-27 04:50:02,481 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:50:04,612 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 106 [2018-10-27 04:50:04,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2018-10-27 04:50:04,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:04,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:04,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:04,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,758 INFO L477 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 22 treesize of output 20 [2018-10-27 04:50:04,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-10-27 04:50:04,765 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,781 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:04,857 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-10-27 04:50:04,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:04,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,998 INFO L477 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 21 treesize of output 19 [2018-10-27 04:50:05,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:05,002 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,020 INFO L477 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 19 [2018-10-27 04:50:05,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:05,024 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-27 04:50:05,039 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,042 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:05,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-10-27 04:50:05,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:05,127 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-10-27 04:50:05,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:05,199 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,207 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,224 INFO L477 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 24 [2018-10-27 04:50:05,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-10-27 04:50:05,231 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-10-27 04:50:05,274 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 04:50:05,317 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,320 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,336 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:05,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 84 [2018-10-27 04:50:05,575 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-27 04:50:05,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:05,580 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,679 INFO L477 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 24 [2018-10-27 04:50:05,695 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2018-10-27 04:50:05,697 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:50:05,748 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 04:50:05,799 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,812 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:05,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-10-27 04:50:05,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:05,819 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,832 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,899 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:50:07,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:50:08,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,011 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,068 INFO L477 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 16 treesize of output 20 [2018-10-27 04:50:08,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 [2018-10-27 04:50:08,075 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-10-27 04:50:08,099 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-10-27 04:50:08,130 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,132 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-10-27 04:50:08,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:08,139 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,146 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,160 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:08,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-10-27 04:50:08,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,213 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:08,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,256 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,265 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,269 INFO L477 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 16 treesize of output 16 [2018-10-27 04:50:08,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-10-27 04:50:08,272 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,282 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,314 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:08,322 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:50:08,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,364 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,402 INFO L477 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 21 treesize of output 19 [2018-10-27 04:50:08,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,405 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,412 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,418 INFO L477 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 16 treesize of output 15 [2018-10-27 04:50:08,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,421 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-27 04:50:08,431 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,434 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,448 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:09,914 INFO L477 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 11 treesize of output 9 [2018-10-27 04:50:09,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-10-27 04:50:09,917 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,922 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-27 04:50:09,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-10-27 04:50:09,928 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,933 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-10-27 04:50:10,612 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 04:50:10,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:10,618 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:10,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:10,713 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,731 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,768 INFO L477 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 48 treesize of output 52 [2018-10-27 04:50:10,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-10-27 04:50:10,793 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-10-27 04:50:10,854 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:10,942 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2018-10-27 04:50:10,943 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:11,014 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:11,136 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-10-27 04:50:11,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-27 04:50:11,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,475 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,515 INFO L477 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 20 treesize of output 24 [2018-10-27 04:50:11,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:50:11,521 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:50:11,569 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:11,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 11 [2018-10-27 04:50:11,609 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:11,649 INFO L267 ElimStorePlain]: Start of recursive call 66: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:11,700 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:11,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-10-27 04:50:11,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,773 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-27 04:50:11,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:11,823 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,855 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,935 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-27 04:50:11,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,000 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,039 INFO L477 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-10-27 04:50:12,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-10-27 04:50:12,044 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:12,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-10-27 04:50:12,082 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,123 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:50:12,124 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:12,161 INFO L267 ElimStorePlain]: Start of recursive call 76: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:12,202 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:12,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-10-27 04:50:12,635 INFO L202 ElimStorePlain]: Needed 79 recursive calls to eliminate 13 variables, input treesize:276, output treesize:65 [2018-10-27 04:50:12,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-10-27 04:50:12,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-10-27 04:50:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:12,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:12,831 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:12,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:12,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:12,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:12,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:12,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:50:12,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-27 04:50:12,969 INFO L477 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 11 treesize of output 8 [2018-10-27 04:50:12,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:12,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,006 INFO L477 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 11 treesize of output 8 [2018-10-27 04:50:13,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:13,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2018-10-27 04:50:13,060 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:50:13,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:50:13,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,111 INFO L477 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 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:50:13,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:50:13,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-10-27 04:50:13,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:50:13,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:50:13,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:50:13,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-10-27 04:50:13,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2018-10-27 04:50:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:13,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:15,987 WARN L179 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 106 [2018-10-27 04:50:15,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:50:16,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-10-27 04:50:16,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:16,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,109 INFO L477 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 16 treesize of output 20 [2018-10-27 04:50:16,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 [2018-10-27 04:50:16,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:16,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-10-27 04:50:16,160 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:16,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-10-27 04:50:16,354 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-27 04:50:16,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,358 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-10-27 04:50:16,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:16,431 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,444 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,461 INFO L477 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 16 treesize of output 20 [2018-10-27 04:50:16,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:50:16,466 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,504 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:50:16,507 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-27 04:50:16,531 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,543 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:16,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 04:50:16,606 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:50:16,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,650 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,689 INFO L477 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 21 treesize of output 19 [2018-10-27 04:50:16,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:16,693 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,703 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,709 INFO L477 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 16 treesize of output 15 [2018-10-27 04:50:16,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-27 04:50:16,716 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:16,727 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,729 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,748 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:16,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-10-27 04:50:16,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,797 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:16,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:16,843 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,851 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,854 INFO L477 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 16 treesize of output 16 [2018-10-27 04:50:16,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-10-27 04:50:16,860 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,868 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,903 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:19,012 INFO L477 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 0 case distinctions, treesize of input 83 treesize of output 76 [2018-10-27 04:50:19,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:19,099 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,186 INFO L477 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 63 treesize of output 56 [2018-10-27 04:50:19,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,192 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 39 [2018-10-27 04:50:19,217 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,235 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,250 INFO L477 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 99 treesize of output 90 [2018-10-27 04:50:19,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-10-27 04:50:19,257 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,298 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,321 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,331 INFO L477 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 59 treesize of output 54 [2018-10-27 04:50:19,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,336 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 35 [2018-10-27 04:50:19,364 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,385 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:19,393 INFO L477 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 64 treesize of output 59 [2018-10-27 04:50:19,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,399 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2018-10-27 04:50:19,424 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,439 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,657 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-10-27 04:50:19,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-10-27 04:50:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:19,756 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,838 INFO L477 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 48 treesize of output 48 [2018-10-27 04:50:19,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-27 04:50:19,846 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,863 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:19,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,873 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,890 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,966 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 87 [2018-10-27 04:50:20,569 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-10-27 04:50:20,577 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 71 [2018-10-27 04:50:20,577 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 65 treesize of output 70 [2018-10-27 04:50:20,589 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,602 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 106 [2018-10-27 04:50:20,602 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 63 treesize of output 66 [2018-10-27 04:50:20,614 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-10-27 04:50:21,596 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-27 04:50:21,611 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-10-27 04:50:21,619 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,378 INFO L477 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 65 treesize of output 57 [2018-10-27 04:50:22,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:22,383 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 35 [2018-10-27 04:50:22,414 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:22,440 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:22,446 INFO L477 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 70 treesize of output 62 [2018-10-27 04:50:22,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:22,451 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 46 treesize of output 22 [2018-10-27 04:50:22,478 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,496 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,502 INFO L477 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 69 treesize of output 59 [2018-10-27 04:50:22,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:22,507 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 [2018-10-27 04:50:22,529 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:22,548 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:23,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-10-27 04:50:23,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2018-10-27 04:50:23,220 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,237 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,243 INFO L477 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 66 treesize of output 58 [2018-10-27 04:50:23,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-27 04:50:23,253 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:23,290 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:23,296 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-10-27 04:50:23,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-27 04:50:23,307 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:23,331 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:24,114 INFO L477 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 69 treesize of output 65 [2018-10-27 04:50:24,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-10-27 04:50:24,122 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:24,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 45 [2018-10-27 04:50:24,183 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:24,246 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:24,279 INFO L477 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 65 treesize of output 63 [2018-10-27 04:50:24,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-10-27 04:50:24,295 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:24,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 51 treesize of output 45 [2018-10-27 04:50:24,394 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:24,479 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:25,565 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-10-27 04:50:37,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2018-10-27 04:50:37,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:37,828 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:37,896 INFO L477 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 22 treesize of output 20 [2018-10-27 04:50:37,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-10-27 04:50:37,901 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:37,909 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:37,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:50:37,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:37,916 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:37,924 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:37,975 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:37,986 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-10-27 04:50:38,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:38,051 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,124 INFO L477 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 19 [2018-10-27 04:50:38,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:38,130 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-27 04:50:38,148 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,152 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,157 INFO L477 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 21 treesize of output 19 [2018-10-27 04:50:38,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:38,161 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,171 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,196 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:38,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-10-27 04:50:38,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:38,277 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-10-27 04:50:38,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 6 treesize of output 1 [2018-10-27 04:50:38,340 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,352 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,373 INFO L477 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 24 [2018-10-27 04:50:38,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-10-27 04:50:38,380 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 04:50:38,423 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,429 INFO L267 ElimStorePlain]: Start of recursive call 97: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:38,449 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:45,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-27 04:50:45,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-10-27 04:50:45,209 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,213 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-27 04:50:45,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-10-27 04:50:45,218 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,222 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-27 04:50:45,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:45,917 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,955 INFO L477 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-10-27 04:50:45,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:50:45,960 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:45,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-27 04:50:45,999 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:46,049 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:50:46,050 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:46,088 INFO L267 ElimStorePlain]: Start of recursive call 106: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:46,136 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:46,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-10-27 04:50:46,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:46,204 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-27 04:50:46,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:46,234 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,238 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,253 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-27 04:50:46,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:46,319 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,372 INFO L477 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 20 treesize of output 24 [2018-10-27 04:50:46,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 17 [2018-10-27 04:50:46,377 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:46,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-10-27 04:50:46,423 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:46,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:50:46,473 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:46,514 INFO L267 ElimStorePlain]: Start of recursive call 116: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:46,564 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:46,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-10-27 04:50:46,965 INFO L202 ElimStorePlain]: Needed 119 recursive calls to eliminate 13 variables, input treesize:276, output treesize:65 [2018-10-27 04:50:47,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-10-27 04:50:47,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-10-27 04:50:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:47,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 04:50:47,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 13 [2018-10-27 04:50:47,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:50:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:50:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:50:47,097 INFO L87 Difference]: Start difference. First operand 307 states and 337 transitions. Second operand 14 states. [2018-10-27 04:50:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:51,449 INFO L93 Difference]: Finished difference Result 313 states and 344 transitions. [2018-10-27 04:50:51,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:50:51,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-10-27 04:50:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:51,452 INFO L225 Difference]: With dead ends: 313 [2018-10-27 04:50:51,452 INFO L226 Difference]: Without dead ends: 313 [2018-10-27 04:50:51,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 249 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:50:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-27 04:50:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 306. [2018-10-27 04:50:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-27 04:50:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 336 transitions. [2018-10-27 04:50:51,456 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 336 transitions. Word has length 66 [2018-10-27 04:50:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:51,456 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 336 transitions. [2018-10-27 04:50:51,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:50:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 336 transitions. [2018-10-27 04:50:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:50:51,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:51,457 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:51,457 INFO L424 AbstractCegarLoop]: === Iteration 54 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:50:51,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1058940356, now seen corresponding path program 1 times [2018-10-27 04:50:51,457 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:51,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:51,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:50:51,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:50:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:50:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:50:51,535 INFO L87 Difference]: Start difference. First operand 306 states and 336 transitions. Second operand 3 states. [2018-10-27 04:50:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:51,551 INFO L93 Difference]: Finished difference Result 471 states and 522 transitions. [2018-10-27 04:50:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:50:51,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-27 04:50:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:51,555 INFO L225 Difference]: With dead ends: 471 [2018-10-27 04:50:51,556 INFO L226 Difference]: Without dead ends: 471 [2018-10-27 04:50:51,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:50:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-27 04:50:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 360. [2018-10-27 04:50:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-27 04:50:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 404 transitions. [2018-10-27 04:50:51,560 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 404 transitions. Word has length 68 [2018-10-27 04:50:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:51,560 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 404 transitions. [2018-10-27 04:50:51,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:50:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 404 transitions. [2018-10-27 04:50:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:50:51,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:51,561 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:51,561 INFO L424 AbstractCegarLoop]: === Iteration 55 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:50:51,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1116198658, now seen corresponding path program 1 times [2018-10-27 04:50:51,562 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:51,562 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:51,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:51,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-10-27 04:50:51,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:50:51,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,964 INFO L477 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 23 treesize of output 24 [2018-10-27 04:50:51,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-10-27 04:50:51,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:50:51,982 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,993 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:45, output treesize:7 [2018-10-27 04:50:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:52,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:52,094 INFO L477 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 26 treesize of output 30 [2018-10-27 04:50:52,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:50:52,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 04:50:52,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-10-27 04:50:52,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:52,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:52,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:27 [2018-10-27 04:50:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:52,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:50:52,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-10-27 04:50:52,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:50:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:50:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:50:52,241 INFO L87 Difference]: Start difference. First operand 360 states and 404 transitions. Second operand 12 states. [2018-10-27 04:50:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:55,352 INFO L93 Difference]: Finished difference Result 414 states and 457 transitions. [2018-10-27 04:50:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:50:55,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-10-27 04:50:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:55,356 INFO L225 Difference]: With dead ends: 414 [2018-10-27 04:50:55,356 INFO L226 Difference]: Without dead ends: 414 [2018-10-27 04:50:55,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:50:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-27 04:50:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 310. [2018-10-27 04:50:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-27 04:50:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 340 transitions. [2018-10-27 04:50:55,360 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 340 transitions. Word has length 68 [2018-10-27 04:50:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:55,360 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 340 transitions. [2018-10-27 04:50:55,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:50:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 340 transitions. [2018-10-27 04:50:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-27 04:50:55,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:55,361 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:55,361 INFO L424 AbstractCegarLoop]: === Iteration 56 === [mainErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr58ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr55ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr59ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr48ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr51ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr52ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr60ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr57ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr56ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr53ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr54ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:50:55,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -674156783, now seen corresponding path program 1 times [2018-10-27 04:50:55,362 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:55,362 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddd3da8b-3866-4410-846a-7a5c3165f78a/bin-2019/utaipan/cvc4nyu Starting monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:55,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:55,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:50:55,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-10-27 04:50:55,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:50:55,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:55,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:50:55,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:50:55,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-10-27 04:50:55,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:50:55,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,835 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:50:55,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:50:55,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,882 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:50:55,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:25 [2018-10-27 04:50:55,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:55,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:55,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-10-27 04:50:56,000 INFO L477 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 21 treesize of output 16 [2018-10-27 04:50:56,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:56,009 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-10-27 04:50:56,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,061 INFO L477 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 21 treesize of output 16 [2018-10-27 04:50:56,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:56,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 25 [2018-10-27 04:50:56,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:40 [2018-10-27 04:50:56,187 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-10-27 04:50:56,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:50:56,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,244 INFO L477 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-10-27 04:50:56,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:50:56,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:36 [2018-10-27 04:50:56,326 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-10-27 04:50:56,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:50:56,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,370 INFO L477 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-10-27 04:50:56,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 04:50:56,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-10-27 04:50:56,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:50:56,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:50:56,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-10-27 04:50:56,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:56,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-10-27 04:50:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:50:56,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:58,807 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 04:51:01,018 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 04:51:07,113 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 04:51:32,092 WARN L179 SmtUtils]: Spent 4.40 s on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 04:51:59,913 WARN L179 SmtUtils]: Spent 4.74 s on a formula simplification that was a NOOP. DAG size: 79 [2018-10-27 04:51:59,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 259 [2018-10-27 04:52:00,317 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-10-27 04:52:00,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:52:00,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:00,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 241 [2018-10-27 04:52:02,299 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2018-10-27 04:52:02,446 INFO L477 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 2 case distinctions, treesize of input 145 treesize of output 145 [2018-10-27 04:52:02,508 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:02,564 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-10-27 04:52:02,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 149 [2018-10-27 04:52:02,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:52:03,176 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:03,185 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 140 [2018-10-27 04:52:03,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:03,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:52:04,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 139 [2018-10-27 04:52:04,569 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:04,585 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 130 [2018-10-27 04:52:04,586 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:04,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 172 [2018-10-27 04:52:10,116 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 214 DAG size of output: 189 [2018-10-27 04:52:10,327 INFO L477 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 2 case distinctions, treesize of input 56 treesize of output 61 [2018-10-27 04:52:10,344 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:10,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 68 [2018-10-27 04:52:10,575 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 04:52:10,852 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:52:10,858 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2018-10-27 04:52:10,859 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:11,078 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:52:15,226 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:52:15,227 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_508 term size 59 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 04:52:15,239 INFO L168 Benchmark]: Toolchain (without parser) took 260705.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 947.9 MB in the beginning and 1.2 GB in the end (delta: -269.0 MB). Peak memory consumption was 412.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,239 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:52:15,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.97 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.06 ms. Allocated memory is still 1.0 GB. Free memory was 926.4 MB in the beginning and 921.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,240 INFO L168 Benchmark]: Boogie Preprocessor took 141.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 921.0 MB in the beginning and 1.2 GB in the end (delta: -246.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,240 INFO L168 Benchmark]: RCFGBuilder took 1663.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,240 INFO L168 Benchmark]: TraceAbstraction took 258394.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.1 MB). Peak memory consumption was 382.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:52:15,242 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.97 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.06 ms. Allocated memory is still 1.0 GB. Free memory was 926.4 MB in the beginning and 921.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 921.0 MB in the beginning and 1.2 GB in the end (delta: -246.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1663.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258394.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.1 MB). Peak memory consumption was 382.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_508 term size 59 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_508 term size 59: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...