./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:33:19,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:33:19,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:33:19,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:33:19,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:33:19,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:33:19,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:33:19,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:33:19,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:33:19,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:33:19,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:33:19,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:33:19,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:33:19,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:33:19,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:33:19,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:33:19,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:33:19,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:33:19,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:33:19,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:33:19,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:33:19,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:33:19,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:33:19,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:33:19,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:33:19,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:33:19,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:33:19,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:33:19,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:33:19,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:33:19,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:33:19,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:33:19,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:33:19,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:33:19,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:33:19,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:33:19,903 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 04:33:19,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:33:19,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:33:19,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:33:19,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:33:19,911 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:33:19,912 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:33:19,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:33:19,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:33:19,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:33:19,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:33:19,912 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:33:19,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:33:19,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:33:19,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:33:19,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:33:19,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:33:19,915 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_5b40bb58-61b1-4c07-a159-ff7fc9755166/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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-12-02 04:33:19,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:33:19,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:33:19,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:33:19,942 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:33:19,942 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:33:19,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:19,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/8073ae6c8/cb78093f0a7748cfb15bf8e9b32dec52/FLAGf59c784af [2018-12-02 04:33:20,422 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:33:20,423 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:20,428 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/8073ae6c8/cb78093f0a7748cfb15bf8e9b32dec52/FLAGf59c784af [2018-12-02 04:33:20,436 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/8073ae6c8/cb78093f0a7748cfb15bf8e9b32dec52 [2018-12-02 04:33:20,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:33:20,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:33:20,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:33:20,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:33:20,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:33:20,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20, skipping insertion in model container [2018-12-02 04:33:20,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:33:20,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:33:20,609 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:33:20,614 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:33:20,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:33:20,693 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:33:20,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20 WrapperNode [2018-12-02 04:33:20,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:33:20,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:33:20,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:33:20,694 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:33:20,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:33:20,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:33:20,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:33:20,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:33:20,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... [2018-12-02 04:33:20,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:33:20,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:33:20,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:33:20,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:33:20,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:33:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:33:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 04:33:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:33:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:33:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 04:33:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 04:33:20,978 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:33:20,978 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 04:33:20,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:20 BoogieIcfgContainer [2018-12-02 04:33:20,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:33:20,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:33:20,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:33:20,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:33:20,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:33:20" (1/3) ... [2018-12-02 04:33:20,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5212cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:33:20, skipping insertion in model container [2018-12-02 04:33:20,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:20" (2/3) ... [2018-12-02 04:33:20,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5212cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:33:20, skipping insertion in model container [2018-12-02 04:33:20,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:20" (3/3) ... [2018-12-02 04:33:20,983 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:20,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:33:20,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 04:33:21,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 04:33:21,018 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:33:21,018 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 04:33:21,018 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:33:21,018 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:33:21,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:33:21,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:33:21,019 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:33:21,019 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:33:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-12-02 04:33:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 04:33:21,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,036 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1822317789, now seen corresponding path program 1 times [2018-12-02 04:33:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:21,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:33:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:33:21,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:33:21,187 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2018-12-02 04:33:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:21,372 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-02 04:33:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:33:21,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 04:33:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:21,380 INFO L225 Difference]: With dead ends: 120 [2018-12-02 04:33:21,380 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 04:33:21,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 04:33:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-12-02 04:33:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 04:33:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-12-02 04:33:21,407 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 9 [2018-12-02 04:33:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:21,407 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-12-02 04:33:21,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:33:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-12-02 04:33:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 04:33:21,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,408 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1822317788, now seen corresponding path program 1 times [2018-12-02 04:33:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:21,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:33:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:33:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:33:21,442 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2018-12-02 04:33:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:21,511 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-12-02 04:33:21,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:33:21,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 04:33:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:21,512 INFO L225 Difference]: With dead ends: 94 [2018-12-02 04:33:21,513 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 04:33:21,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 04:33:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-02 04:33:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 04:33:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-12-02 04:33:21,517 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 9 [2018-12-02 04:33:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:21,518 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-12-02 04:33:21,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:33:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-12-02 04:33:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:33:21,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,518 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 657276647, now seen corresponding path program 1 times [2018-12-02 04:33:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:21,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:21,539 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-12-02 04:33:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:21,573 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-12-02 04:33:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:21,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:33:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:21,574 INFO L225 Difference]: With dead ends: 90 [2018-12-02 04:33:21,574 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 04:33:21,575 INFO L631 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-12-02 04:33:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 04:33:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-02 04:33:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 04:33:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-12-02 04:33:21,578 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2018-12-02 04:33:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:21,578 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-12-02 04:33:21,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-12-02 04:33:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:33:21,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash 657276648, now seen corresponding path program 1 times [2018-12-02 04:33:21,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:21,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:21,602 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-12-02 04:33:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:21,635 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-02 04:33:21,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:21,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:33:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:21,636 INFO L225 Difference]: With dead ends: 86 [2018-12-02 04:33:21,636 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 04:33:21,636 INFO L631 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-12-02 04:33:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 04:33:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 04:33:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 04:33:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-12-02 04:33:21,640 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2018-12-02 04:33:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:21,640 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-12-02 04:33:21,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-12-02 04:33:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 04:33:21,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,641 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1483418616, now seen corresponding path program 1 times [2018-12-02 04:33:21,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:33:21,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:21,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:21,726 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2018-12-02 04:33:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:21,878 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-02 04:33:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:33:21,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 04:33:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:21,879 INFO L225 Difference]: With dead ends: 97 [2018-12-02 04:33:21,879 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 04:33:21,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:33:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 04:33:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-02 04:33:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 04:33:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-02 04:33:21,884 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2018-12-02 04:33:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:21,884 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-02 04:33:21,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-02 04:33:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 04:33:21,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:21,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:21,885 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:21,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1258941260, now seen corresponding path program 1 times [2018-12-02 04:33:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:21,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:21,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:21,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:33:21,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:21,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:33:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:33:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:21,945 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-12-02 04:33:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,047 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-02 04:33:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:33:22,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 04:33:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,047 INFO L225 Difference]: With dead ends: 105 [2018-12-02 04:33:22,048 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 04:33:22,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:33:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 04:33:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-12-02 04:33:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:33:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-02 04:33:22,051 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 16 [2018-12-02 04:33:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,051 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-02 04:33:22,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:33:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-02 04:33:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 04:33:22,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,052 INFO L402 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-12-02 04:33:22,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash -822176144, now seen corresponding path program 1 times [2018-12-02 04:33:22,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:33:22,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:22,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:33:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:33:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:33:22,109 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-12-02 04:33:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,244 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-12-02 04:33:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:33:22,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 04:33:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,245 INFO L225 Difference]: With dead ends: 101 [2018-12-02 04:33:22,245 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 04:33:22,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:33:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 04:33:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-12-02 04:33:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:33:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-12-02 04:33:22,248 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2018-12-02 04:33:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,249 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-12-02 04:33:22,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:33:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-12-02 04:33:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 04:33:22,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,249 INFO L402 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-12-02 04:33:22,250 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash -822176143, now seen corresponding path program 1 times [2018-12-02 04:33:22,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,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-12-02 04:33:22,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:22,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:33:22,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:22,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:33:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:33:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:33:22,313 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-12-02 04:33:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,427 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-02 04:33:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:33:22,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 04:33:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,429 INFO L225 Difference]: With dead ends: 98 [2018-12-02 04:33:22,429 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 04:33:22,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:33:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 04:33:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-12-02 04:33:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 04:33:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-12-02 04:33:22,432 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 25 [2018-12-02 04:33:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,432 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-02 04:33:22,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:33:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-12-02 04:33:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 04:33:22,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,433 INFO L402 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-12-02 04:33:22,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash -822188091, now seen corresponding path program 1 times [2018-12-02 04:33:22,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:22,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:22,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:33:22,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:22,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:22,448 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-12-02 04:33:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,455 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-12-02 04:33:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:22,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 04:33:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,456 INFO L225 Difference]: With dead ends: 72 [2018-12-02 04:33:22,456 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 04:33:22,456 INFO L631 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-12-02 04:33:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 04:33:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 04:33:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 04:33:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-02 04:33:22,458 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2018-12-02 04:33:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,459 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-02 04:33:22,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-02 04:33:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 04:33:22,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,459 INFO L402 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-12-02 04:33:22,460 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash -821075162, now seen corresponding path program 1 times [2018-12-02 04:33:22,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:22,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:33:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:33:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:33:22,477 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 4 states. [2018-12-02 04:33:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,489 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-02 04:33:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:33:22,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 04:33:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,490 INFO L225 Difference]: With dead ends: 68 [2018-12-02 04:33:22,490 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 04:33:22,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 04:33:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 04:33:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-12-02 04:33:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 04:33:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-12-02 04:33:22,492 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2018-12-02 04:33:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,492 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-12-02 04:33:22,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:33:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-12-02 04:33:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 04:33:22,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,492 INFO L402 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-12-02 04:33:22,493 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 748999106, now seen corresponding path program 1 times [2018-12-02 04:33:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:33:22,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:33:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:33:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:22,525 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-12-02 04:33:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:22,586 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-02 04:33:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:33:22,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 04:33:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:22,587 INFO L225 Difference]: With dead ends: 66 [2018-12-02 04:33:22,587 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 04:33:22,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 04:33:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 04:33:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 04:33:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-02 04:33:22,589 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2018-12-02 04:33:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:22,589 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-02 04:33:22,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:33:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-02 04:33:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:33:22,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:22,590 INFO L402 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] [2018-12-02 04:33:22,590 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:22,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1127647248, now seen corresponding path program 1 times [2018-12-02 04:33:22,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:22,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:22,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:22,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:33:22,721 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 04:33:22,722 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [17], [93], [94], [97], [100], [101], [106], [107], [112], [115], [117], [120], [121], [124], [125], [126], [127], [129], [130] [2018-12-02 04:33:22,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:33:22,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:33:22,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:33:22,899 INFO L272 AbstractInterpreter]: Visited 24 different actions 60 times. Merged at 4 different actions 8 times. Never widened. Performed 682 root evaluator evaluations with a maximum evaluation depth of 3. Performed 682 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-12-02 04:33:22,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:22,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:33:22,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:22,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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-12-02 04:33:22,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:22,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:33:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:22,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:22,999 INFO L478 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-12-02 04:33:23,001 INFO L478 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-12-02 04:33:23,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,025 INFO L478 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-12-02 04:33:23,027 INFO L478 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-12-02 04:33:23,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,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-12-02 04:33:23,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 04:33:23,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:23,079 INFO L478 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-12-02 04:33:23,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:23,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:23,091 INFO L478 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 15 treesize of output 8 [2018-12-02 04:33:23,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-02 04:33:23,151 INFO L478 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 04:33:23,155 INFO L478 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 24 treesize of output 23 [2018-12-02 04:33:23,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,188 INFO L478 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 04:33:23,191 INFO L478 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-12-02 04:33:23,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,212 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-12-02 04:33:23,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-02 04:33:23,247 INFO L478 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 36 treesize of output 34 [2018-12-02 04:33:23,250 INFO L478 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 26 treesize of output 10 [2018-12-02 04:33:23,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,269 INFO L478 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 26 treesize of output 26 [2018-12-02 04:33:23,271 INFO L478 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 22 treesize of output 15 [2018-12-02 04:33:23,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,279 INFO L478 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 8 [2018-12-02 04:33:23,280 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,287 INFO L478 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 18 treesize of output 3 [2018-12-02 04:33:23,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,295 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-02 04:33:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:23,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:23,565 INFO L478 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 33 [2018-12-02 04:33:23,566 INFO L478 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-12-02 04:33:23,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,572 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:23,573 INFO L478 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 16 treesize of output 14 [2018-12-02 04:33:23,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,579 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:23,580 INFO L478 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-12-02 04:33:23,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:23,625 INFO L478 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 19 treesize of output 17 [2018-12-02 04:33:23,626 INFO L478 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-12-02 04:33:23,626 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,629 INFO L478 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-12-02 04:33:23,631 INFO L478 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-12-02 04:33:23,631 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,633 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,661 INFO L478 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 24 treesize of output 22 [2018-12-02 04:33:23,662 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:23,662 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,665 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,666 INFO L478 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 22 [2018-12-02 04:33:23,669 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:23,669 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,671 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,672 INFO L478 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-12-02 04:33:23,673 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:23,674 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,676 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-02 04:33:23,693 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-12-02 04:33:23,822 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,823 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,823 INFO L478 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 25 treesize of output 16 [2018-12-02 04:33:23,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-02 04:33:23,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,853 INFO L478 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 16 treesize of output 14 [2018-12-02 04:33:23,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,866 INFO L478 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 23 treesize of output 14 [2018-12-02 04:33:23,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,879 INFO L478 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-12-02 04:33:23,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,888 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,888 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:23,888 INFO L478 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 16 treesize of output 7 [2018-12-02 04:33:23,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:23,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 04:33:23,896 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:106, output treesize:12 [2018-12-02 04:33:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:23,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:33:23,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 25 [2018-12-02 04:33:23,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:33:23,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 04:33:23,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 04:33:23,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-12-02 04:33:23,953 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 17 states. [2018-12-02 04:33:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:24,553 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-02 04:33:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:33:24,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 04:33:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:24,554 INFO L225 Difference]: With dead ends: 72 [2018-12-02 04:33:24,554 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 04:33:24,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 04:33:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 04:33:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-02 04:33:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 04:33:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-02 04:33:24,556 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 30 [2018-12-02 04:33:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:24,557 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-02 04:33:24,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 04:33:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-02 04:33:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:33:24,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:24,557 INFO L402 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] [2018-12-02 04:33:24,558 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:24,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1127647249, now seen corresponding path program 1 times [2018-12-02 04:33:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:24,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:24,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:24,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:33:24,665 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 04:33:24,665 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [17], [93], [94], [97], [100], [101], [106], [107], [111], [115], [117], [120], [121], [124], [125], [126], [127], [129], [130] [2018-12-02 04:33:24,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:33:24,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:33:24,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:33:24,727 INFO L272 AbstractInterpreter]: Visited 24 different actions 60 times. Merged at 4 different actions 8 times. Never widened. Performed 670 root evaluator evaluations with a maximum evaluation depth of 3. Performed 670 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-12-02 04:33:24,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:24,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:33:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:24,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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-12-02 04:33:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:24,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:33:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:24,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:24,790 INFO L478 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-12-02 04:33:24,791 INFO L478 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-12-02 04:33:24,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 04:33:24,817 INFO L478 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 16 treesize of output 15 [2018-12-02 04:33:24,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 04:33:24,854 INFO L478 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 04:33:24,856 INFO L478 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-12-02 04:33:24,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,869 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-12-02 04:33:24,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 04:33:24,894 INFO L478 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 28 [2018-12-02 04:33:24,896 INFO L478 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 20 treesize of output 5 [2018-12-02 04:33:24,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:24,902 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-12-02 04:33:24,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 04:33:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:24,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:24,996 INFO L478 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 9 treesize of output 7 [2018-12-02 04:33:24,997 INFO L478 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-12-02 04:33:24,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:24,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:25,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 04:33:25,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:44 [2018-12-02 04:33:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:25,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:33:25,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2018-12-02 04:33:25,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:33:25,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 04:33:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 04:33:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-02 04:33:25,059 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 17 states. [2018-12-02 04:33:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:25,402 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-02 04:33:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:33:25,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 04:33:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:25,403 INFO L225 Difference]: With dead ends: 71 [2018-12-02 04:33:25,403 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 04:33:25,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-12-02 04:33:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 04:33:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-02 04:33:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 04:33:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-02 04:33:25,405 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-12-02 04:33:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:25,406 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-02 04:33:25,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 04:33:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-02 04:33:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:33:25,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:25,406 INFO L402 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-12-02 04:33:25,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1744135889, now seen corresponding path program 1 times [2018-12-02 04:33:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:25,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:25,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:25,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:25,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:33:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:33:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:33:25,428 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 5 states. [2018-12-02 04:33:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:25,478 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 04:33:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:33:25,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 04:33:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:25,479 INFO L225 Difference]: With dead ends: 68 [2018-12-02 04:33:25,479 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 04:33:25,480 INFO L631 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-12-02 04:33:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 04:33:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 04:33:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 04:33:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-02 04:33:25,482 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-12-02 04:33:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:25,482 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-02 04:33:25,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:33:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-02 04:33:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:33:25,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:25,483 INFO L402 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-12-02 04:33:25,483 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1766362203, now seen corresponding path program 1 times [2018-12-02 04:33:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:25,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:25,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:33:25,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:25,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:25,543 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2018-12-02 04:33:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:25,652 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-02 04:33:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:33:25,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-02 04:33:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:25,652 INFO L225 Difference]: With dead ends: 67 [2018-12-02 04:33:25,652 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 04:33:25,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:33:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 04:33:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 04:33:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 04:33:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-02 04:33:25,654 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 30 [2018-12-02 04:33:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:25,654 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-02 04:33:25,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-02 04:33:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 04:33:25,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:25,655 INFO L402 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-12-02 04:33:25,655 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:25,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1766362202, now seen corresponding path program 1 times [2018-12-02 04:33:25,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:25,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:25,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:25,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:33:25,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:25,671 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 3 states. [2018-12-02 04:33:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:25,693 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-02 04:33:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:25,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 04:33:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:25,694 INFO L225 Difference]: With dead ends: 63 [2018-12-02 04:33:25,694 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 04:33:25,694 INFO L631 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-12-02 04:33:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 04:33:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 04:33:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 04:33:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-02 04:33:25,695 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 30 [2018-12-02 04:33:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:25,696 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-02 04:33:25,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-02 04:33:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 04:33:25,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:25,696 INFO L402 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-12-02 04:33:25,696 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-02 04:33:25,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1058542129, now seen corresponding path program 1 times [2018-12-02 04:33:25,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:33:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:33:25,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:33:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:33:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:33:25,723 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:33:25,733 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 04:33:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:33:25 BoogieIcfgContainer [2018-12-02 04:33:25,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:33:25,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:33:25,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:33:25,747 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:33:25,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:20" (3/4) ... [2018-12-02 04:33:25,750 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:33:25,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:33:25,750 INFO L168 Benchmark]: Toolchain (without parser) took 5311.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 890.3 MB in the end (delta: 56.7 MB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:25,751 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:25,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:25,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:25,752 INFO L168 Benchmark]: Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:25,752 INFO L168 Benchmark]: RCFGBuilder took 250.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:25,752 INFO L168 Benchmark]: TraceAbstraction took 4767.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 890.3 MB in the end (delta: 163.9 MB). Peak memory consumption was 217.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:25,752 INFO L168 Benchmark]: Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 890.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:25,753 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4767.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 890.3 MB in the end (delta: 163.9 MB). Peak memory consumption was 217.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 890.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=12, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={11:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={11:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={11:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={11:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={11:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={11:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={11:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 41 error locations. UNSAFE Result, 4.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 830 SDtfs, 724 SDslu, 1965 SDs, 0 SdLazy, 2109 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 65 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 446 ConstructedInterpolants, 22 QuantifiedInterpolants, 102863 SizeOfPredicates, 47 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 12/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:33:27,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:33:27,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:33:27,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:33:27,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:33:27,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:33:27,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:33:27,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:33:27,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:33:27,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:33:27,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:33:27,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:33:27,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:33:27,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:33:27,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:33:27,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:33:27,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:33:27,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:33:27,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:33:27,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:33:27,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:33:27,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:33:27,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:33:27,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:33:27,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:33:27,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:33:27,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:33:27,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:33:27,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:33:27,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:33:27,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:33:27,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:33:27,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:33:27,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:33:27,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:33:27,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:33:27,132 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 04:33:27,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:33:27,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:33:27,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:33:27,140 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:33:27,140 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:33:27,140 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:33:27,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:33:27,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:33:27,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:33:27,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:33:27,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:33:27,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:33:27,143 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 04:33:27,143 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_5b40bb58-61b1-4c07-a159-ff7fc9755166/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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-12-02 04:33:27,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:33:27,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:33:27,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:33:27,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:33:27,171 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:33:27,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:27,207 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/ade04c4e9/f6b17a9ddeec4053b472ab8e0ae091b5/FLAGb58f79727 [2018-12-02 04:33:27,672 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:33:27,673 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:27,682 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/ade04c4e9/f6b17a9ddeec4053b472ab8e0ae091b5/FLAGb58f79727 [2018-12-02 04:33:27,691 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/data/ade04c4e9/f6b17a9ddeec4053b472ab8e0ae091b5 [2018-12-02 04:33:27,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:33:27,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:33:27,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:33:27,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:33:27,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:33:27,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:33:27" (1/1) ... [2018-12-02 04:33:27,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f01457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:27, skipping insertion in model container [2018-12-02 04:33:27,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:33:27" (1/1) ... [2018-12-02 04:33:27,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:33:27,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:33:27,908 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:33:27,916 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:33:27,949 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:33:28,007 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:33:28,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28 WrapperNode [2018-12-02 04:33:28,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:33:28,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:33:28,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:33:28,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:33:28,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:33:28,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:33:28,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:33:28,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:33:28,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... [2018-12-02 04:33:28,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:33:28,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:33:28,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:33:28,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:33:28,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/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-12-02 04:33:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:33:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:33:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:33:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:33:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 04:33:28,078 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 04:33:28,382 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:33:28,383 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 04:33:28,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:28 BoogieIcfgContainer [2018-12-02 04:33:28,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:33:28,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:33:28,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:33:28,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:33:28,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:33:27" (1/3) ... [2018-12-02 04:33:28,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7038d82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:33:28, skipping insertion in model container [2018-12-02 04:33:28,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:33:28" (2/3) ... [2018-12-02 04:33:28,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7038d82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:33:28, skipping insertion in model container [2018-12-02 04:33:28,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:28" (3/3) ... [2018-12-02 04:33:28,387 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-02 04:33:28,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:33:28,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 04:33:28,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 04:33:28,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:33:28,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:33:28,422 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 04:33:28,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:33:28,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:33:28,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:33:28,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:33:28,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:33:28,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:33:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-12-02 04:33:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 04:33:28,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:28,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:28,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:28,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:28,440 INFO L82 PathProgramCache]: Analyzing trace with hash -694748710, now seen corresponding path program 1 times [2018-12-02 04:33:28,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:28,443 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:28,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:28,534 INFO L478 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-12-02 04:33:28,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:33:28,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:28,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:28,556 INFO L478 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 19 treesize of output 23 [2018-12-02 04:33:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,564 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-12-02 04:33:28,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 04:33:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:28,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:28,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:28,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:33:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:33:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:33:28,599 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-12-02 04:33:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:28,870 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-12-02 04:33:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:33:28,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 04:33:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:28,877 INFO L225 Difference]: With dead ends: 88 [2018-12-02 04:33:28,877 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 04:33:28,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 04:33:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-02 04:33:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 04:33:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-02 04:33:28,907 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2018-12-02 04:33:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:28,907 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-02 04:33:28,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:33:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-02 04:33:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 04:33:28,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:28,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:28,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:28,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash -694748709, now seen corresponding path program 1 times [2018-12-02 04:33:28,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:28,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:28,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:28,959 INFO L478 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-12-02 04:33:28,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,966 INFO L478 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-12-02 04:33:28,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:28,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 04:33:28,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:29,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:29,001 INFO L478 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 12 treesize of output 21 [2018-12-02 04:33:29,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:29,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:29,016 INFO L478 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-12-02 04:33:29,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:29,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-02 04:33:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:29,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:33:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:33:29,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:33:29,041 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-12-02 04:33:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:29,397 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-12-02 04:33:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:33:29,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 04:33:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:29,400 INFO L225 Difference]: With dead ends: 110 [2018-12-02 04:33:29,400 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 04:33:29,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:33:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 04:33:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2018-12-02 04:33:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 04:33:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-12-02 04:33:29,405 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 9 [2018-12-02 04:33:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:29,406 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-12-02 04:33:29,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:33:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-12-02 04:33:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:33:29,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:29,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:29,406 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:29,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -62373464, now seen corresponding path program 1 times [2018-12-02 04:33:29,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:29,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:29,451 INFO L478 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-12-02 04:33:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:33:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:29,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:29,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:29,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:29,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:29,461 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2018-12-02 04:33:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:29,541 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-12-02 04:33:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:29,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:33:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:29,542 INFO L225 Difference]: With dead ends: 89 [2018-12-02 04:33:29,542 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 04:33:29,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 04:33:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-02 04:33:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 04:33:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-02 04:33:29,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2018-12-02 04:33:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:29,546 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-02 04:33:29,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-02 04:33:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:33:29,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:29,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:29,547 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:29,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash -62373463, now seen corresponding path program 1 times [2018-12-02 04:33:29,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:29,548 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:29,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:29,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:29,596 INFO L478 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-12-02 04:33:29,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:33:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:29,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:29,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:29,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:29,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:29,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:29,610 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-12-02 04:33:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:29,695 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-12-02 04:33:29,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:29,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:33:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:29,696 INFO L225 Difference]: With dead ends: 85 [2018-12-02 04:33:29,696 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 04:33:29,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-02 04:33:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 04:33:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-02 04:33:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 04:33:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-02 04:33:29,701 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2018-12-02 04:33:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:29,701 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-02 04:33:29,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-02 04:33:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 04:33:29,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:29,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:29,702 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:29,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2119422501, now seen corresponding path program 1 times [2018-12-02 04:33:29,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:29,703 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:29,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:29,850 INFO L478 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 04:33:29,854 INFO L478 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 24 treesize of output 23 [2018-12-02 04:33:29,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,932 INFO L478 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 04:33:29,937 INFO L478 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 19 treesize of output 18 [2018-12-02 04:33:29,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,967 INFO L478 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 20 treesize of output 19 [2018-12-02 04:33:29,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:29,988 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-12-02 04:33:29,988 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 04:33:30,026 INFO L478 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 26 [2018-12-02 04:33:30,030 INFO L478 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 22 treesize of output 15 [2018-12-02 04:33:30,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,047 INFO L478 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 8 [2018-12-02 04:33:30,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,062 INFO L478 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 18 treesize of output 3 [2018-12-02 04:33:30,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,084 INFO L478 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 26 [2018-12-02 04:33:30,087 INFO L478 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 22 treesize of output 15 [2018-12-02 04:33:30,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,103 INFO L478 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 8 [2018-12-02 04:33:30,103 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,115 INFO L478 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 18 treesize of output 3 [2018-12-02 04:33:30,115 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,121 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-02 04:33:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:30,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:30,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:30,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:33:30,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=39, Unknown=4, NotChecked=0, Total=56 [2018-12-02 04:33:30,135 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2018-12-02 04:33:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:30,667 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-02 04:33:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:33:30,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 04:33:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:30,668 INFO L225 Difference]: With dead ends: 93 [2018-12-02 04:33:30,668 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 04:33:30,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=98, Unknown=12, NotChecked=0, Total=156 [2018-12-02 04:33:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 04:33:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-02 04:33:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 04:33:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-12-02 04:33:30,673 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 15 [2018-12-02 04:33:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:30,673 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-12-02 04:33:30,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-12-02 04:33:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 04:33:30,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:30,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:30,674 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:30,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1277866221, now seen corresponding path program 1 times [2018-12-02 04:33:30,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:30,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:30,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:30,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:30,789 INFO L478 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-12-02 04:33:30,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:30,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:30,807 INFO L478 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-12-02 04:33:30,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:30,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:30,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 04:33:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:30,852 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:30,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:33:30,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:33:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:33:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:33:30,855 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2018-12-02 04:33:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:31,083 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-02 04:33:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:33:31,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 04:33:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:31,084 INFO L225 Difference]: With dead ends: 93 [2018-12-02 04:33:31,084 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 04:33:31,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:33:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 04:33:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-02 04:33:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 04:33:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-02 04:33:31,088 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 16 [2018-12-02 04:33:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:31,089 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-02 04:33:31,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:33:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-02 04:33:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 04:33:31,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:31,089 INFO L402 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-12-02 04:33:31,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1281445896, now seen corresponding path program 1 times [2018-12-02 04:33:31,090 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:31,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:31,170 INFO L478 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-12-02 04:33:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 04:33:31,187 INFO L478 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-12-02 04:33:31,188 INFO L478 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-12-02 04:33:31,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 04:33:31,213 INFO L478 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 15 [2018-12-02 04:33:31,215 INFO L478 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 7 [2018-12-02 04:33:31,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 04:33:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:31,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:31,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:31,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:33:31,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:31,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:31,227 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 8 states. [2018-12-02 04:33:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:31,698 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-02 04:33:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:33:31,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-02 04:33:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:31,699 INFO L225 Difference]: With dead ends: 105 [2018-12-02 04:33:31,699 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 04:33:31,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:33:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 04:33:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-02 04:33:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 04:33:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-02 04:33:31,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2018-12-02 04:33:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:31,704 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-02 04:33:31,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-02 04:33:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 04:33:31,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:31,705 INFO L402 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-12-02 04:33:31,705 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1281445897, now seen corresponding path program 1 times [2018-12-02 04:33:31,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:31,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:31,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:31,834 INFO L478 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-12-02 04:33:31,837 INFO L478 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-12-02 04:33:31,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,853 INFO L478 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-12-02 04:33:31,855 INFO L478 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-12-02 04:33:31,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 04:33:31,899 INFO L478 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-12-02 04:33:31,901 INFO L478 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-12-02 04:33:31,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,911 INFO L478 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-12-02 04:33:31,913 INFO L478 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-12-02 04:33:31,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:31,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 04:33:31,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-12-02 04:33:31,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:33:31,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:31,939 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-12-02 04:33:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:32,335 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-02 04:33:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:33:32,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-02 04:33:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:32,336 INFO L225 Difference]: With dead ends: 102 [2018-12-02 04:33:32,336 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 04:33:32,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:33:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 04:33:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-12-02 04:33:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 04:33:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-12-02 04:33:32,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 24 [2018-12-02 04:33:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-12-02 04:33:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-12-02 04:33:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 04:33:32,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:32,340 INFO L402 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-12-02 04:33:32,341 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1281433948, now seen corresponding path program 1 times [2018-12-02 04:33:32,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:32,341 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:32,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:32,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:32,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:32,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:32,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:33:32,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:33:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:33:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:33:32,414 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2018-12-02 04:33:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:32,434 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-02 04:33:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:33:32,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-02 04:33:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:32,436 INFO L225 Difference]: With dead ends: 114 [2018-12-02 04:33:32,436 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 04:33:32,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-12-02 04:33:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 04:33:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-12-02 04:33:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 04:33:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-02 04:33:32,440 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 24 [2018-12-02 04:33:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:32,440 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-02 04:33:32,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:33:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-02 04:33:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 04:33:32,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:32,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:33:32,441 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:32,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1885375817, now seen corresponding path program 1 times [2018-12-02 04:33:32,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:32,441 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:32,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:32,526 INFO L478 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-12-02 04:33:32,527 INFO L478 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-12-02 04:33:32,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 04:33:32,548 INFO L478 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-12-02 04:33:32,549 INFO L478 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-12-02 04:33:32,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 04:33:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:32,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:32,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:32,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:33:32,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:33:32,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:33:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:33:32,561 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 7 states. [2018-12-02 04:33:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:32,778 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-02 04:33:32,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:33:32,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 04:33:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:32,779 INFO L225 Difference]: With dead ends: 114 [2018-12-02 04:33:32,779 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 04:33:32,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:33:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 04:33:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-12-02 04:33:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 04:33:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 04:33:32,781 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-12-02 04:33:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:32,782 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 04:33:32,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:33:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 04:33:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:33:32,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:32,782 INFO L402 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] [2018-12-02 04:33:32,783 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:32,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 8678806, now seen corresponding path program 1 times [2018-12-02 04:33:32,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:32,783 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:32,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:32,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:32,902 INFO L478 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-12-02 04:33:32,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 04:33:32,925 INFO L478 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-12-02 04:33:32,927 INFO L478 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-12-02 04:33:32,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 04:33:32,964 INFO L478 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 15 [2018-12-02 04:33:32,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:32,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-02 04:33:33,021 INFO L478 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 04:33:33,024 INFO L478 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 28 treesize of output 27 [2018-12-02 04:33:33,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,053 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-12-02 04:33:33,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-02 04:33:33,088 INFO L478 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 30 treesize of output 30 [2018-12-02 04:33:33,090 INFO L478 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 26 treesize of output 19 [2018-12-02 04:33:33,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,106 INFO L478 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 22 treesize of output 7 [2018-12-02 04:33:33,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,113 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-12-02 04:33:33,113 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-02 04:33:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:33,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:33,292 INFO L478 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-12-02 04:33:33,294 INFO L478 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-12-02 04:33:33,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 04:33:33,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-02 04:33:33,374 INFO L478 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 12 [2018-12-02 04:33:33,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,387 INFO L478 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 12 [2018-12-02 04:33:33,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:33:33,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-02 04:33:33,400 INFO L478 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-12-02 04:33:33,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,402 INFO L478 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 10 treesize of output 3 [2018-12-02 04:33:33,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:33:33,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-02 04:33:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:33,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:33,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:33:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:33,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:33,453 INFO L478 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-12-02 04:33:33,455 INFO L478 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-12-02 04:33:33,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 04:33:33,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:33,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:33,467 INFO L478 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 23 treesize of output 35 [2018-12-02 04:33:33,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,475 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-12-02 04:33:33,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:25 [2018-12-02 04:33:33,561 INFO L478 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 04:33:33,565 INFO L478 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 36 treesize of output 35 [2018-12-02 04:33:33,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-12-02 04:33:33,665 INFO L478 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 38 treesize of output 36 [2018-12-02 04:33:33,668 INFO L478 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 32 treesize of output 25 [2018-12-02 04:33:33,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,695 INFO L478 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 25 treesize of output 16 [2018-12-02 04:33:33,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,715 INFO L478 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 26 treesize of output 10 [2018-12-02 04:33:33,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:33,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:17 [2018-12-02 04:33:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:33,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:33,927 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:33,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-02 04:33:33,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:33,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 04:33:33,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:83 [2018-12-02 04:33:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:34,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 04:33:34,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9] total 23 [2018-12-02 04:33:34,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 04:33:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 04:33:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-12-02 04:33:34,112 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 24 states. [2018-12-02 04:33:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:35,736 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-12-02 04:33:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:33:35,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-02 04:33:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:35,737 INFO L225 Difference]: With dead ends: 118 [2018-12-02 04:33:35,737 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 04:33:35,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 04:33:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 04:33:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2018-12-02 04:33:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 04:33:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-02 04:33:35,740 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 29 [2018-12-02 04:33:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:35,740 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-02 04:33:35,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 04:33:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-02 04:33:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:33:35,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:35,741 INFO L402 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] [2018-12-02 04:33:35,741 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:35,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash 8678807, now seen corresponding path program 1 times [2018-12-02 04:33:35,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:35,741 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:35,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:35,889 INFO L478 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-12-02 04:33:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:35,905 INFO L478 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-12-02 04:33:35,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:35,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:35,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 04:33:35,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:35,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:35,933 INFO L478 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-12-02 04:33:35,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:35,948 INFO L478 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 12 treesize of output 15 [2018-12-02 04:33:35,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:35,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:35,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-02 04:33:36,007 INFO L478 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-12-02 04:33:36,010 INFO L478 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-12-02 04:33:36,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,030 INFO L478 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-12-02 04:33:36,032 INFO L478 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-12-02 04:33:36,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:36,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-12-02 04:33:36,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:36,124 INFO L478 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 21 treesize of output 36 [2018-12-02 04:33:36,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:36,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:36,144 INFO L478 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 17 treesize of output 8 [2018-12-02 04:33:36,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:36,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2018-12-02 04:33:36,249 INFO L478 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 3 case distinctions, treesize of input 35 treesize of output 43 [2018-12-02 04:33:36,252 INFO L478 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 36 treesize of output 35 [2018-12-02 04:33:36,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,328 INFO L478 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 04:33:36,331 INFO L478 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 24 treesize of output 23 [2018-12-02 04:33:36,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:36,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-02 04:33:36,429 INFO L478 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 26 [2018-12-02 04:33:36,432 INFO L478 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 22 treesize of output 15 [2018-12-02 04:33:36,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,453 INFO L478 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 8 [2018-12-02 04:33:36,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,470 INFO L478 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 18 treesize of output 3 [2018-12-02 04:33:36,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,503 INFO L478 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 38 treesize of output 36 [2018-12-02 04:33:36,507 INFO L478 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 32 treesize of output 25 [2018-12-02 04:33:36,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,538 INFO L478 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 25 treesize of output 16 [2018-12-02 04:33:36,539 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,562 INFO L478 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 28 treesize of output 12 [2018-12-02 04:33:36,562 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:36,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:36,576 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-12-02 04:33:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:36,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:37,682 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-02 04:33:37,686 INFO L478 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-12-02 04:33:37,689 INFO L478 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-12-02 04:33:37,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,697 INFO L478 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-12-02 04:33:37,698 INFO L478 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-12-02 04:33:37,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,706 INFO L478 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 19 treesize of output 17 [2018-12-02 04:33:37,708 INFO L478 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-12-02 04:33:37,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:37,905 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:37,909 INFO L478 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 16 treesize of output 14 [2018-12-02 04:33:37,909 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:37,923 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:37,927 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:37,930 INFO L478 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-12-02 04:33:37,930 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:37,943 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:38,116 INFO L478 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 21 [2018-12-02 04:33:38,120 INFO L478 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 11 treesize of output 7 [2018-12-02 04:33:38,121 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,125 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,127 INFO L478 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 25 treesize of output 21 [2018-12-02 04:33:38,131 INFO L478 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 11 treesize of output 7 [2018-12-02 04:33:38,132 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,136 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,276 INFO L478 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 22 [2018-12-02 04:33:38,279 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:38,279 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:38,291 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:38,293 INFO L478 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 24 treesize of output 22 [2018-12-02 04:33:38,296 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:38,296 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:38,307 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:38,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-02 04:33:38,447 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-02 04:33:38,779 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-02 04:33:38,787 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,787 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,788 INFO L478 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 18 treesize of output 9 [2018-12-02 04:33:38,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,847 INFO L478 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 20 treesize of output 11 [2018-12-02 04:33:38,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,905 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,905 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,906 INFO L478 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 16 treesize of output 7 [2018-12-02 04:33:38,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:38,966 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,967 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:38,967 INFO L478 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 16 treesize of output 7 [2018-12-02 04:33:38,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:39,017 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:39,017 INFO L478 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 23 treesize of output 14 [2018-12-02 04:33:39,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-12-02 04:33:39,066 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-12-02 04:33:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:39,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:33:39,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:33:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:39,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:39,675 INFO L478 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-12-02 04:33:39,677 INFO L478 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-12-02 04:33:39,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,695 INFO L478 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-12-02 04:33:39,698 INFO L478 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-12-02 04:33:39,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:28 [2018-12-02 04:33:39,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:39,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:39,842 INFO L478 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 17 treesize of output 8 [2018-12-02 04:33:39,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,854 INFO L478 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-12-02 04:33:39,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:39,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:39,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2018-12-02 04:33:40,049 INFO L478 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 04:33:40,058 INFO L478 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 19 treesize of output 18 [2018-12-02 04:33:40,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,111 INFO L478 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 20 treesize of output 19 [2018-12-02 04:33:40,111 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,172 INFO L478 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 04:33:40,175 INFO L478 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-12-02 04:33:40,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:40,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:54 [2018-12-02 04:33:40,322 INFO L478 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 26 [2018-12-02 04:33:40,325 INFO L478 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 22 treesize of output 15 [2018-12-02 04:33:40,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,364 INFO L478 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 18 treesize of output 3 [2018-12-02 04:33:40,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,405 INFO L478 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 36 treesize of output 34 [2018-12-02 04:33:40,408 INFO L478 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 30 treesize of output 23 [2018-12-02 04:33:40,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,449 INFO L478 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 14 [2018-12-02 04:33:40,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,476 INFO L478 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 26 treesize of output 10 [2018-12-02 04:33:40,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:40,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:40,492 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:68, output treesize:20 [2018-12-02 04:33:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:40,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:33:41,225 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-02 04:33:41,228 INFO L478 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-12-02 04:33:41,230 INFO L478 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-12-02 04:33:41,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,236 INFO L478 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-12-02 04:33:41,239 INFO L478 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-12-02 04:33:41,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,248 INFO L478 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 19 treesize of output 17 [2018-12-02 04:33:41,250 INFO L478 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-12-02 04:33:41,251 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,422 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:41,425 INFO L478 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-12-02 04:33:41,426 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,443 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,446 INFO L478 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 28 treesize of output 26 [2018-12-02 04:33:41,450 INFO L478 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 16 treesize of output 14 [2018-12-02 04:33:41,451 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,469 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,653 INFO L478 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 21 [2018-12-02 04:33:41,655 INFO L478 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 11 treesize of output 7 [2018-12-02 04:33:41,657 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,661 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,663 INFO L478 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 25 treesize of output 21 [2018-12-02 04:33:41,665 INFO L478 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 11 treesize of output 7 [2018-12-02 04:33:41,667 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,669 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:41,795 INFO L478 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 22 [2018-12-02 04:33:41,798 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:41,798 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,809 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,812 INFO L478 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 24 treesize of output 22 [2018-12-02 04:33:41,814 INFO L478 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 12 treesize of output 10 [2018-12-02 04:33:41,814 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,826 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:41,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-02 04:33:41,972 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-02 04:33:42,244 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2018-12-02 04:33:42,247 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:42,248 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:42,248 INFO L478 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 38 treesize of output 29 [2018-12-02 04:33:42,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:42,303 INFO L478 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 29 treesize of output 27 [2018-12-02 04:33:42,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:42,353 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:42,354 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:33:42,354 INFO L478 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 38 treesize of output 29 [2018-12-02 04:33:42,354 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:42,404 INFO L478 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 29 treesize of output 27 [2018-12-02 04:33:42,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:33:42,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 04:33:42,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:122, output treesize:49 [2018-12-02 04:33:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:42,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 04:33:42,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9, 10] total 30 [2018-12-02 04:33:42,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 04:33:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 04:33:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2018-12-02 04:33:42,736 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 31 states. [2018-12-02 04:33:43,754 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2018-12-02 04:33:44,278 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2018-12-02 04:33:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:50,058 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-12-02 04:33:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:33:50,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2018-12-02 04:33:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:50,060 INFO L225 Difference]: With dead ends: 120 [2018-12-02 04:33:50,060 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 04:33:50,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=259, Invalid=1223, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 04:33:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 04:33:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-12-02 04:33:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 04:33:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-12-02 04:33:50,062 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 29 [2018-12-02 04:33:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:50,062 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-12-02 04:33:50,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 04:33:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-12-02 04:33:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 04:33:50,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:50,063 INFO L402 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-12-02 04:33:50,063 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:50,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1682891735, now seen corresponding path program 1 times [2018-12-02 04:33:50,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:50,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:50,149 INFO L478 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-12-02 04:33:50,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 04:33:50,166 INFO L478 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-12-02 04:33:50,167 INFO L478 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-12-02 04:33:50,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 04:33:50,196 INFO L478 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-12-02 04:33:50,198 INFO L478 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-12-02 04:33:50,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-02 04:33:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:50,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:33:50,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:33:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:33:50,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:33:50,213 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 8 states. [2018-12-02 04:33:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:50,545 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-12-02 04:33:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:33:50,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 04:33:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:50,545 INFO L225 Difference]: With dead ends: 111 [2018-12-02 04:33:50,545 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 04:33:50,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:33:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 04:33:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-12-02 04:33:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 04:33:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-02 04:33:50,547 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 28 [2018-12-02 04:33:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:50,547 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-02 04:33:50,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:33:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-02 04:33:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:33:50,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:50,548 INFO L402 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-12-02 04:33:50,548 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:50,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash -630036148, now seen corresponding path program 1 times [2018-12-02 04:33:50,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:50,549 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:50,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:50,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:50,646 INFO L478 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-12-02 04:33:50,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:33:50,670 INFO L478 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-12-02 04:33:50,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-02 04:33:50,684 INFO L478 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-12-02 04:33:50,686 INFO L478 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-12-02 04:33:50,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-02 04:33:50,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:50,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:50,711 INFO L478 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 17 treesize of output 8 [2018-12-02 04:33:50,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-02 04:33:50,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 04:33:50,730 INFO L478 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 12 treesize of output 4 [2018-12-02 04:33:50,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 04:33:50,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:33:50,751 INFO L478 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 12 treesize of output 21 [2018-12-02 04:33:50,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:33:50,757 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-12-02 04:33:50,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 04:33:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:50,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:33:50,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 04:33:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 04:33:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:33:50,778 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-12-02 04:33:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:57,221 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-12-02 04:33:57,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:33:57,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-02 04:33:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:57,222 INFO L225 Difference]: With dead ends: 128 [2018-12-02 04:33:57,222 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 04:33:57,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:33:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 04:33:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-12-02 04:33:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 04:33:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-02 04:33:57,224 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-12-02 04:33:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:57,224 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-02 04:33:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 04:33:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-02 04:33:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:33:57,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:57,224 INFO L402 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-12-02 04:33:57,225 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:57,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash -630036147, now seen corresponding path program 1 times [2018-12-02 04:33:57,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:33:57,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:33:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:33:57,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:33:57,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:33:57,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:33:57,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:33:57,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:33:57,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:33:57,285 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 3 states. [2018-12-02 04:33:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:33:57,393 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-12-02 04:33:57,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:33:57,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 04:33:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:33:57,394 INFO L225 Difference]: With dead ends: 100 [2018-12-02 04:33:57,394 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 04:33:57,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-12-02 04:33:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 04:33:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-12-02 04:33:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 04:33:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-12-02 04:33:57,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 29 [2018-12-02 04:33:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:33:57,396 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-12-02 04:33:57,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:33:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-12-02 04:33:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 04:33:57,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:33:57,397 INFO L402 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-12-02 04:33:57,397 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 04:33:57,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:33:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 491863990, now seen corresponding path program 1 times [2018-12-02 04:33:57,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:33:57,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b40bb58-61b1-4c07-a159-ff7fc9755166/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:33:57,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:33:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:33:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:33:57,687 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:33:57,696 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 04:33:57,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:33:57 BoogieIcfgContainer [2018-12-02 04:33:57,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:33:57,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:33:57,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:33:57,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:33:57,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:33:28" (3/4) ... [2018-12-02 04:33:57,713 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:33:57,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:33:57,713 INFO L168 Benchmark]: Toolchain (without parser) took 30019.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 936.7 MB in the beginning and 1.2 GB in the end (delta: -222.1 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:57,713 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:57,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:57,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:57,714 INFO L168 Benchmark]: Boogie Preprocessor took 19.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:57,714 INFO L168 Benchmark]: RCFGBuilder took 337.07 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:57,714 INFO L168 Benchmark]: TraceAbstraction took 29326.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.9 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:33:57,714 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:33:57,715 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 337.07 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29326.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.9 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2139090935:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2139090935:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 41 error locations. UNSAFE Result, 29.2s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 1216 SDslu, 2510 SDs, 0 SdLazy, 3111 SolverSat, 161 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 360 SyntacticMatches, 6 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 129 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 465 ConstructedInterpolants, 76 QuantifiedInterpolants, 175101 SizeOfPredicates, 167 NumberOfNonLiveVariables, 1887 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 16/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...