./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:33:25,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:25,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:25,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:25,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:25,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:25,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:25,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:25,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:25,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:25,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:25,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:25,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:25,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:25,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:25,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:25,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:25,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:25,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:25,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:25,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:25,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:25,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:25,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:25,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:25,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:25,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:25,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:25,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:25,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:25,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:25,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:25,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:25,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:25,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:25,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:25,660 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 10:33:25,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:25,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:25,668 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:33:25,668 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:33:25,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:25,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:25,669 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:25,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:25,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 10:33:25,670 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 10:33:25,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:33:25,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:25,671 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:25,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:25,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:25,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:33:25,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:33:25,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer 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 -> Automizer 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-11-28 10:33:25,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:25,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:25,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:25,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:25,714 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:25,715 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:25,760 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/8ae87d2ae/6998b65a279f4e06bb25dafaa85255a9/FLAG19d1c7e04 [2018-11-28 10:33:26,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:26,206 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:26,213 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/8ae87d2ae/6998b65a279f4e06bb25dafaa85255a9/FLAG19d1c7e04 [2018-11-28 10:33:26,224 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/8ae87d2ae/6998b65a279f4e06bb25dafaa85255a9 [2018-11-28 10:33:26,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:26,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 10:33:26,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:26,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:26,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:26,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a709441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:26,261 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:26,434 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:26,442 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:26,524 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:26,557 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:26,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26 WrapperNode [2018-11-28 10:33:26,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:26,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:26,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:26,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:26,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:26,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:26,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:26,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:26,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:33:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-11-28 10:33:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-11-28 10:33:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:33:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 10:33:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 10:33:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 10:33:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 10:33:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 10:33:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 10:33:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 10:33:26,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 10:33:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 10:33:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 10:33:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 10:33:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 10:33:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 10:33:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:33:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:26,945 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:26,946 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 10:33:26,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26 BoogieIcfgContainer [2018-11-28 10:33:26,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:26,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:33:26,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:33:26,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:33:26,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:33:26" (1/3) ... [2018-11-28 10:33:26,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a41e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (2/3) ... [2018-11-28 10:33:26,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a41e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26" (3/3) ... [2018-11-28 10:33:26,951 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:26,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:33:26,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-11-28 10:33:26,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-11-28 10:33:26,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:26,994 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:33:26,995 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 10:33:26,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:33:26,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:26,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:26,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:33:26,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:26,995 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:33:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-28 10:33:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:33:27,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:27,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:27,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:27,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-11-28 10:33:27,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:27,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:27,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:27,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:33:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:27,180 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-11-28 10:33:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:27,329 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-28 10:33:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:27,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:33:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:27,336 INFO L225 Difference]: With dead ends: 66 [2018-11-28 10:33:27,337 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 10:33:27,338 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-11-28 10:33:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 10:33:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-28 10:33:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 10:33:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-28 10:33:27,362 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-11-28 10:33:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:27,363 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-28 10:33:27,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:33:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-28 10:33:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:33:27,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:27,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:27,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:27,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-11-28 10:33:27,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:27,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:33:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:27,454 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-11-28 10:33:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:27,601 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-28 10:33:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:27,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:33:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:27,603 INFO L225 Difference]: With dead ends: 62 [2018-11-28 10:33:27,603 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 10:33:27,603 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-11-28 10:33:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 10:33:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-28 10:33:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 10:33:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-28 10:33:27,608 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-11-28 10:33:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:27,609 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-28 10:33:27,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:33:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-28 10:33:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 10:33:27,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:27,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:27,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:27,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-11-28 10:33:27,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:27,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:27,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:33:27,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:33:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:33:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:33:27,697 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 7 states. [2018-11-28 10:33:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:27,786 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 10:33:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:27,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-28 10:33:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:27,787 INFO L225 Difference]: With dead ends: 59 [2018-11-28 10:33:27,787 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 10:33:27,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:33:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 10:33:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-28 10:33:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 10:33:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-28 10:33:27,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-11-28 10:33:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:27,791 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-28 10:33:27,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:33:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-28 10:33:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:33:27,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:27,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:27,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:27,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-11-28 10:33:27,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:27,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:27,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:27,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:33:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:27,859 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 5 states. [2018-11-28 10:33:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:27,945 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-28 10:33:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:33:27,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 10:33:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:27,946 INFO L225 Difference]: With dead ends: 58 [2018-11-28 10:33:27,946 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 10:33:27,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:33:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 10:33:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-28 10:33:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 10:33:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-28 10:33:27,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-11-28 10:33:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:27,950 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-28 10:33:27,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:33:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-28 10:33:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:33:27,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:27,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:27,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:27,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-11-28 10:33:27,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:28,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:33:28,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:33:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:33:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:33:28,055 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 6 states. [2018-11-28 10:33:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:28,165 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-28 10:33:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:33:28,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-28 10:33:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:28,167 INFO L225 Difference]: With dead ends: 57 [2018-11-28 10:33:28,167 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 10:33:28,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 10:33:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-28 10:33:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 10:33:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-28 10:33:28,171 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-11-28 10:33:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:28,171 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-28 10:33:28,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:33:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-28 10:33:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:33:28,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:28,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:28,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:28,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-11-28 10:33:28,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 10:33:28,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 10:33:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 10:33:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:33:28,265 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2018-11-28 10:33:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:28,452 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-28 10:33:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:33:28,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-28 10:33:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:28,453 INFO L225 Difference]: With dead ends: 56 [2018-11-28 10:33:28,453 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 10:33:28,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:33:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 10:33:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 10:33:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 10:33:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-28 10:33:28,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-11-28 10:33:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:28,459 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-28 10:33:28,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 10:33:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-28 10:33:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:33:28,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:28,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:28,460 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:28,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-11-28 10:33:28,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 10:33:28,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 10:33:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 10:33:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:33:28,617 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 11 states. [2018-11-28 10:33:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:28,818 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-28 10:33:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:33:28,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-28 10:33:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:28,819 INFO L225 Difference]: With dead ends: 55 [2018-11-28 10:33:28,819 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 10:33:28,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:33:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 10:33:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-28 10:33:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 10:33:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-28 10:33:28,822 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-11-28 10:33:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-28 10:33:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 10:33:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-28 10:33:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 10:33:28,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:28,823 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] [2018-11-28 10:33:28,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:28,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-11-28 10:33:28,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:28,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:33:28,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:33:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:33:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:33:28,873 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 8 states. [2018-11-28 10:33:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:28,949 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 10:33:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:33:28,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 10:33:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:28,950 INFO L225 Difference]: With dead ends: 59 [2018-11-28 10:33:28,950 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 10:33:28,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 10:33:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-28 10:33:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 10:33:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-28 10:33:28,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-11-28 10:33:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:28,954 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-28 10:33:28,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:33:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-28 10:33:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 10:33:28,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:28,955 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] [2018-11-28 10:33:28,955 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:28,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-11-28 10:33:28,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:29,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:33:29,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 10:33:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 10:33:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:29,065 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 9 states. [2018-11-28 10:33:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:29,190 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-28 10:33:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:33:29,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-28 10:33:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:29,191 INFO L225 Difference]: With dead ends: 49 [2018-11-28 10:33:29,191 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 10:33:29,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:33:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 10:33:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-28 10:33:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 10:33:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-28 10:33:29,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-11-28 10:33:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:29,195 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-28 10:33:29,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 10:33:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-28 10:33:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:33:29,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:29,196 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] [2018-11-28 10:33:29,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-11-28 10:33:29,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:29,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 10:33:29,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 10:33:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 10:33:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:33:29,570 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2018-11-28 10:33:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:30,237 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-28 10:33:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 10:33:30,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-11-28 10:33:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:30,239 INFO L225 Difference]: With dead ends: 50 [2018-11-28 10:33:30,239 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 10:33:30,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 10:33:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 10:33:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-28 10:33:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 10:33:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-28 10:33:30,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-11-28 10:33:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:30,242 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-28 10:33:30,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 10:33:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-28 10:33:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:33:30,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:30,243 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] [2018-11-28 10:33:30,243 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:30,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-11-28 10:33:30,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:30,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:30,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:30,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:33:30,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:33:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:33:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:30,553 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-11-28 10:33:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:31,101 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-28 10:33:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:33:31,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-28 10:33:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:31,102 INFO L225 Difference]: With dead ends: 48 [2018-11-28 10:33:31,102 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 10:33:31,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-11-28 10:33:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 10:33:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-28 10:33:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 10:33:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-28 10:33:31,104 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-11-28 10:33:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:31,105 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-28 10:33:31,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:33:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-28 10:33:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:33:31,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:31,105 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-11-28 10:33:31,106 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:31,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-11-28 10:33:31,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:31,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:31,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:31,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:33:31,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:33:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:33:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:31,483 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-11-28 10:33:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:32,218 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-28 10:33:32,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:33:32,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-28 10:33:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:32,219 INFO L225 Difference]: With dead ends: 47 [2018-11-28 10:33:32,219 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 10:33:32,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-11-28 10:33:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 10:33:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-28 10:33:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 10:33:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-28 10:33:32,222 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-11-28 10:33:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:32,222 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-28 10:33:32,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:33:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-28 10:33:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:33:32,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:32,223 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-11-28 10:33:32,223 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:32,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-11-28 10:33:32,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:32,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 10:33:32,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 10:33:32,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 10:33:32,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-11-28 10:33:32,594 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-11-28 10:33:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:33,150 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-28 10:33:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 10:33:33,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-11-28 10:33:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:33,150 INFO L225 Difference]: With dead ends: 43 [2018-11-28 10:33:33,151 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 10:33:33,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-11-28 10:33:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 10:33:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 10:33:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 10:33:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-28 10:33:33,153 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 27 [2018-11-28 10:33:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:33,154 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-28 10:33:33,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 10:33:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-28 10:33:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 10:33:33,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:33,154 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] [2018-11-28 10:33:33,155 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:33,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1829250660, now seen corresponding path program 1 times [2018-11-28 10:33:33,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:33,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 10:33:33,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 10:33:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 10:33:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-28 10:33:33,611 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2018-11-28 10:33:34,079 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-28 10:33:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:34,573 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 10:33:34,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 10:33:34,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-11-28 10:33:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:34,574 INFO L225 Difference]: With dead ends: 45 [2018-11-28 10:33:34,574 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 10:33:34,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 10:33:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 10:33:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 10:33:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 10:33:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-28 10:33:34,576 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-11-28 10:33:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:34,576 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-28 10:33:34,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 10:33:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-28 10:33:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 10:33:34,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:34,577 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] [2018-11-28 10:33:34,577 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:34,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-11-28 10:33:34,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 10:33:35,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 10:33:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 10:33:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:33:35,081 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-11-28 10:33:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:35,903 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-28 10:33:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 10:33:35,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-11-28 10:33:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:35,904 INFO L225 Difference]: With dead ends: 44 [2018-11-28 10:33:35,904 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 10:33:35,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 10:33:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 10:33:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-28 10:33:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 10:33:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-28 10:33:35,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-11-28 10:33:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:35,907 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-28 10:33:35,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 10:33:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-28 10:33:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 10:33:35,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:35,908 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-11-28 10:33:35,908 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:35,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-11-28 10:33:35,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:35,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 10:33:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 10:33:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 10:33:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:33:36,295 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-11-28 10:33:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:36,855 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-28 10:33:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 10:33:36,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-11-28 10:33:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:36,856 INFO L225 Difference]: With dead ends: 43 [2018-11-28 10:33:36,856 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 10:33:36,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 10:33:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 10:33:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-28 10:33:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 10:33:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-28 10:33:36,858 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-11-28 10:33:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:36,858 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-28 10:33:36,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 10:33:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-28 10:33:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 10:33:36,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:36,859 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-11-28 10:33:36,859 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION]=== [2018-11-28 10:33:36,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-11-28 10:33:36,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:36,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:36,905 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:33:36,919 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 10:33:36,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:33:36 BoogieIcfgContainer [2018-11-28 10:33:36,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:33:36,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:36,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:36,938 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:36,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:26" (3/4) ... [2018-11-28 10:33:36,942 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:36,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:36,942 INFO L168 Benchmark]: Toolchain (without parser) took 10715.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -102.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:36,943 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:36,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:36,944 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:36,944 INFO L168 Benchmark]: RCFGBuilder took 348.33 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:36,945 INFO L168 Benchmark]: TraceAbstraction took 9990.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:36,945 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:36,947 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.91 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 348.33 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9990.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={19:0}] [L643] CALL alloc_data(&data) VAL [pdata={19:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L643] RET alloc_data(&data) VAL [data={19:0}] [L644] CALL free_data(&data) VAL [data={19:0}] [L632] EXPR data->lo VAL [data={19:0}, data={19:0}, data->lo={10:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={19:0}, data={19:0}, data->hi={11:0}, lo={10:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L639] data->hi = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L644] RET free_data(&data) VAL [data={19:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 9.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 718 SDslu, 2299 SDs, 0 SdLazy, 3858 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, 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, 16 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 124794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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-0cd3be1 [2018-11-28 10:33:38,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:38,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:38,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:38,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:38,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:38,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:38,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:38,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:38,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:38,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:38,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:38,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:38,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:38,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:38,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:38,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:38,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:38,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:38,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:38,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:38,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:38,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:38,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:38,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:38,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:38,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:38,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:38,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:38,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:38,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:38,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:38,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:38,530 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:38,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:38,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:38,532 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 10:33:38,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:38,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:38,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:33:38,542 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:33:38,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:38,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:38,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:38,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 10:33:38,544 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 10:33:38,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:33:38,546 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 10:33:38,546 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 10:33:38,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:38,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:38,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:38,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:38,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:33:38,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:33:38,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:33:38,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:38,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:33:38,548 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 10:33:38,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:33:38,548 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 10:33:38,548 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_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer 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 -> Automizer 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-11-28 10:33:38,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:38,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:38,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:38,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:38,591 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:38,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:38,637 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/e0da1fe79/12336ed5a80e4965ae44f2e31932b82b/FLAG944f31561 [2018-11-28 10:33:38,978 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:38,979 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:38,989 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/e0da1fe79/12336ed5a80e4965ae44f2e31932b82b/FLAG944f31561 [2018-11-28 10:33:39,000 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/data/e0da1fe79/12336ed5a80e4965ae44f2e31932b82b [2018-11-28 10:33:39,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:39,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 10:33:39,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:39,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:39,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:39,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29af4ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39, skipping insertion in model container [2018-11-28 10:33:39,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:39,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:39,233 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:39,244 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:39,276 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:39,348 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:39,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39 WrapperNode [2018-11-28 10:33:39,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:39,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:39,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:39,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:39,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... [2018-11-28 10:33:39,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:39,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:39,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:39,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:39,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:39,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:33:39,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:39,427 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-11-28 10:33:39,427 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-11-28 10:33:39,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:33:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 10:33:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 10:33:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 10:33:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 10:33:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 10:33:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 10:33:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 10:33:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 10:33:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 10:33:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 10:33:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 10:33:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:33:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:33:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:39,813 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:39,813 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 10:33:39,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:39 BoogieIcfgContainer [2018-11-28 10:33:39,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:39,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:33:39,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:33:39,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:33:39,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:33:39" (1/3) ... [2018-11-28 10:33:39,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729bdbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:39, skipping insertion in model container [2018-11-28 10:33:39,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:39" (2/3) ... [2018-11-28 10:33:39,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729bdbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:33:39, skipping insertion in model container [2018-11-28 10:33:39,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:39" (3/3) ... [2018-11-28 10:33:39,819 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-11-28 10:33:39,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:33:39,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-11-28 10:33:39,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-11-28 10:33:39,861 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:39,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:33:39,861 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 10:33:39,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:33:39,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:39,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:39,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:33:39,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:39,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:33:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-28 10:33:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:33:39,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:39,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:39,881 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:39,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-11-28 10:33:39,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:39,888 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:39,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:39,995 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-11-28 10:33:39,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 10:33:40,053 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 12 treesize of output 11 [2018-11-28 10:33:40,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,058 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-11-28 10:33:40,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-28 10:33:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:40,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:40,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:40,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:33:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:40,092 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-11-28 10:33:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:40,346 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-28 10:33:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:40,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:33:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:40,354 INFO L225 Difference]: With dead ends: 66 [2018-11-28 10:33:40,354 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 10:33:40,355 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-11-28 10:33:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 10:33:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-28 10:33:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 10:33:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-28 10:33:40,381 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-11-28 10:33:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:40,381 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-28 10:33:40,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:33:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-28 10:33:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:33:40,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:40,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:40,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:40,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-11-28 10:33:40,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:40,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:40,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:40,443 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-11-28 10:33:40,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,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-11-28 10:33:40,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 10:33:40,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,499 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-11-28 10:33:40,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,517 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-11-28 10:33:40,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,525 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-11-28 10:33:40,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-28 10:33:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:40,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:40,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:40,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:40,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:33:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:40,544 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-11-28 10:33:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:40,840 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-28 10:33:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:40,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:33:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:40,841 INFO L225 Difference]: With dead ends: 62 [2018-11-28 10:33:40,841 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 10:33:40,842 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-11-28 10:33:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 10:33:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-28 10:33:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 10:33:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-28 10:33:40,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-11-28 10:33:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:40,846 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-28 10:33:40,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:33:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-28 10:33:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 10:33:40,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:40,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:40,848 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:40,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-11-28 10:33:40,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:40,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:40,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:40,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-11-28 10:33:40,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,912 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-11-28 10:33:40,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 10:33:40,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,945 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-11-28 10:33:40,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:40,957 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-11-28 10:33:40,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:40,966 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-11-28 10:33:40,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-28 10:33:41,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,039 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-11-28 10:33:41,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 [2018-11-28 10:33:41,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,081 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-11-28 10:33:41,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2018-11-28 10:33:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:41,093 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:41,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:41,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:33:41,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:33:41,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:33:41,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:33:41,098 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2018-11-28 10:33:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:41,326 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 10:33:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:41,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-28 10:33:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:41,327 INFO L225 Difference]: With dead ends: 59 [2018-11-28 10:33:41,327 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 10:33:41,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-11-28 10:33:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 10:33:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-28 10:33:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 10:33:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-28 10:33:41,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-11-28 10:33:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:41,331 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-28 10:33:41,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:33:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-28 10:33:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:33:41,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:41,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:41,332 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:41,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-11-28 10:33:41,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:41,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:41,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:41,392 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-11-28 10:33:41,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:33:41,410 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-11-28 10:33:41,414 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-11-28 10:33:41,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-11-28 10:33:41,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-11-28 10:33:41,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2018-11-28 10:33:41,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 10:33:41,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:41,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-28 10:33:41,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:41,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-11-28 10:33:41,539 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 47 treesize of output 35 [2018-11-28 10:33:41,542 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-11-28 10:33:41,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:33:41,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:33:41,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:33:41,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2018-11-28 10:33:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:41,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:41,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:41,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:33:41,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 10:33:41,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 10:33:41,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:41,606 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-11-28 10:33:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:41,955 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-28 10:33:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:33:41,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-28 10:33:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:41,956 INFO L225 Difference]: With dead ends: 58 [2018-11-28 10:33:41,956 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 10:33:41,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:33:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 10:33:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-28 10:33:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 10:33:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-28 10:33:41,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-11-28 10:33:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:41,960 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-28 10:33:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 10:33:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-28 10:33:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:33:41,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:41,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:41,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:41,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-11-28 10:33:41,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:41,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:42,040 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-11-28 10:33:42,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,050 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-11-28 10:33:42,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-28 10:33:42,082 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-11-28 10:33:42,085 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-11-28 10:33:42,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,107 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-11-28 10:33:42,110 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-11-28 10:33:42,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-11-28 10:33:42,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:42,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:42,152 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-11-28 10:33:42,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,166 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-11-28 10:33:42,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2018-11-28 10:33:42,216 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 21 treesize of output 16 [2018-11-28 10:33:42,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:42,222 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-11-28 10:33:42,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,261 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 31 treesize of output 24 [2018-11-28 10:33:42,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:42,266 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 24 treesize of output 33 [2018-11-28 10:33:42,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2018-11-28 10:33:42,315 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-11-28 10:33:42,318 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-11-28 10:33:42,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,331 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 38 treesize of output 28 [2018-11-28 10:33:42,337 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 28 treesize of output 15 [2018-11-28 10:33:42,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:33:42,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:33:42,352 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-11-28 10:33:42,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2018-11-28 10:33:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:42,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:42,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:33:42,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 10:33:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 10:33:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:42,376 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 9 states. [2018-11-28 10:33:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:42,890 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-28 10:33:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:33:42,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-28 10:33:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:42,890 INFO L225 Difference]: With dead ends: 57 [2018-11-28 10:33:42,891 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 10:33:42,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:33:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 10:33:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-28 10:33:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 10:33:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-28 10:33:42,893 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-11-28 10:33:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:42,894 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-28 10:33:42,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 10:33:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-28 10:33:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:33:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:42,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:42,894 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:42,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-11-28 10:33:42,895 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:42,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:42,975 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-11-28 10:33:42,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:42,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:33:43,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,007 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-11-28 10:33:43,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 10:33:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:33:43,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, 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-11-28 10:33:43,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 10:33:43,044 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 14 treesize of output 11 [2018-11-28 10:33:43,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2018-11-28 10:33:43,067 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 22 treesize of output 17 [2018-11-28 10:33:43,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,072 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 17 treesize of output 24 [2018-11-28 10:33:43,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 10:33:43,134 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 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-28 10:33:43,136 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 1 [2018-11-28 10:33:43,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2018-11-28 10:33:43,149 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 19 [2018-11-28 10:33:43,152 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 19 treesize of output 10 [2018-11-28 10:33:43,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,156 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-11-28 10:33:43,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-11-28 10:33:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:43,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:43,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:43,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 10:33:43,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 10:33:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 10:33:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:33:43,172 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 10 states. [2018-11-28 10:33:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:43,595 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-28 10:33:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:33:43,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-28 10:33:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:43,597 INFO L225 Difference]: With dead ends: 56 [2018-11-28 10:33:43,597 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 10:33:43,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 10:33:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 10:33:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 10:33:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-28 10:33:43,600 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-11-28 10:33:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:43,600 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-28 10:33:43,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 10:33:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-28 10:33:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:33:43,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:43,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:43,601 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:43,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-11-28 10:33:43,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:43,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:43,713 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-11-28 10:33:43,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:33:43,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,750 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-11-28 10:33:43,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 10:33:43,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:33:43,771 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-11-28 10:33:43,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-28 10:33:43,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 6 treesize of output 5 [2018-11-28 10:33:43,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 10:33:43,824 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 22 treesize of output 17 [2018-11-28 10:33:43,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:43,829 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 17 treesize of output 24 [2018-11-28 10:33:43,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,857 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 13 treesize of output 10 [2018-11-28 10:33:43,859 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 10 treesize of output 9 [2018-11-28 10:33:43,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-11-28 10:33:43,938 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 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-28 10:33:43,941 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 1 [2018-11-28 10:33:43,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-28 10:33:43,978 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 1 [2018-11-28 10:33:43,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-11-28 10:33:43,992 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-11-28 10:33:43,994 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-11-28 10:33:43,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:43,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,006 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 19 [2018-11-28 10:33:44,010 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 19 treesize of output 10 [2018-11-28 10:33:44,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-11-28 10:33:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:44,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 10:33:44,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 10:33:44,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 10:33:44,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:33:44,033 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 10 states. [2018-11-28 10:33:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:44,470 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-28 10:33:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:33:44,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-28 10:33:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:44,471 INFO L225 Difference]: With dead ends: 55 [2018-11-28 10:33:44,471 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 10:33:44,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 10:33:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-28 10:33:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 10:33:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-28 10:33:44,473 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-11-28 10:33:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:44,473 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-28 10:33:44,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 10:33:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-28 10:33:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 10:33:44,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:44,474 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] [2018-11-28 10:33:44,474 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:44,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-11-28 10:33:44,475 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:44,475 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:44,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:44,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:44,542 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-11-28 10:33:44,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:44,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-11-28 10:33:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:44,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:44,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:44,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:33:44,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:33:44,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:33:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:33:44,565 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 7 states. [2018-11-28 10:33:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:44,788 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 10:33:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:33:44,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 10:33:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:44,789 INFO L225 Difference]: With dead ends: 59 [2018-11-28 10:33:44,789 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 10:33:44,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:33:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 10:33:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-28 10:33:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 10:33:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-28 10:33:44,793 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-11-28 10:33:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:44,793 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-28 10:33:44,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:33:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-28 10:33:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 10:33:44,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:44,794 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] [2018-11-28 10:33:44,794 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:44,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-11-28 10:33:44,795 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:44,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:44,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:44,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:44,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:33:44,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:33:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:33:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:33:44,936 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 8 states. [2018-11-28 10:33:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:45,278 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-28 10:33:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:33:45,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 10:33:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:45,279 INFO L225 Difference]: With dead ends: 49 [2018-11-28 10:33:45,279 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 10:33:45,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:33:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 10:33:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-28 10:33:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 10:33:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-28 10:33:45,283 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-11-28 10:33:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:45,283 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-28 10:33:45,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:33:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-28 10:33:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:33:45,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:45,284 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] [2018-11-28 10:33:45,284 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:45,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-11-28 10:33:45,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:45,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:45,411 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-11-28 10:33:45,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:33:45,442 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-11-28 10:33:45,445 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-11-28 10:33:45,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-28 10:33:45,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:45,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:45,478 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-11-28 10:33:45,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-11-28 10:33:45,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-28 10:33:45,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:45,514 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 18 treesize of output 25 [2018-11-28 10:33:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-11-28 10:33:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2018-11-28 10:33:45,647 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 62 treesize of output 42 [2018-11-28 10:33:45,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:45,731 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 57 [2018-11-28 10:33:45,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 10:33:45,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:33:45,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:33:45,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:89 [2018-11-28 10:33:46,002 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-28 10:33:46,005 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 1 [2018-11-28 10:33:46,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,105 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 0 case distinctions, treesize of input 62 treesize of output 56 [2018-11-28 10:33:46,108 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 1 [2018-11-28 10:33:46,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,214 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2018-11-28 10:33:46,218 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 52 treesize of output 28 [2018-11-28 10:33:46,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:46,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2018-11-28 10:33:46,292 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 10:33:46,321 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:33:46,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 10:33:46,370 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2018-11-28 10:33:46,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:46,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:46,452 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 39 treesize of output 31 [2018-11-28 10:33:46,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-11-28 10:33:46,580 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 33 treesize of output 25 [2018-11-28 10:33:46,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-28 10:33:46,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:46,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-11-28 10:33:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:46,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:33:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:46,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:33:46,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:33:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:33:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:33:46,637 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2018-11-28 10:33:49,323 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-11-28 10:33:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:50,080 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-28 10:33:50,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 10:33:50,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-28 10:33:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:33:50,083 INFO L225 Difference]: With dead ends: 50 [2018-11-28 10:33:50,083 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 10:33:50,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-11-28 10:33:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 10:33:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-28 10:33:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 10:33:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-28 10:33:50,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-11-28 10:33:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:33:50,086 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-28 10:33:50,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:33:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-28 10:33:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:33:50,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:33:50,087 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] [2018-11-28 10:33:50,087 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:33:50,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-11-28 10:33:50,088 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:33:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:33:50,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:50,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:50,258 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-11-28 10:33:50,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:33:50,280 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-11-28 10:33:50,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-11-28 10:33:50,311 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-11-28 10:33:50,313 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-11-28 10:33:50,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-11-28 10:33:50,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:50,356 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-11-28 10:33:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2018-11-28 10:33:50,406 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 13 treesize of output 10 [2018-11-28 10:33:50,410 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 10 treesize of output 9 [2018-11-28 10:33:50,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-11-28 10:33:50,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:50,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:50,465 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 45 treesize of output 66 [2018-11-28 10:33:50,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:66 [2018-11-28 10:33:50,681 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 106 treesize of output 108 [2018-11-28 10:33:50,693 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 107 treesize of output 79 [2018-11-28 10:33:50,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:50,878 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 91 [2018-11-28 10:33:50,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:33:51,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:33:51,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2018-11-28 10:33:51,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:51,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:51,176 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 83 treesize of output 72 [2018-11-28 10:33:51,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:51,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:51,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 130 [2018-11-28 10:33:51,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:51,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:51,313 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 110 [2018-11-28 10:33:51,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:33:51,566 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 123 treesize of output 95 [2018-11-28 10:33:51,567 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:51,700 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 10:33:51,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 10:33:51,816 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:173, output treesize:236 [2018-11-28 10:33:52,024 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 10:33:52,251 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 10:33:52,324 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 137 treesize of output 147 [2018-11-28 10:33:52,362 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 2 case distinctions, treesize of input 127 treesize of output 111 [2018-11-28 10:33:52,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:33:52,649 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 128 treesize of output 104 [2018-11-28 10:33:52,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:52,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:33:55,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:55,222 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 0 case distinctions, treesize of input 163 treesize of output 167 [2018-11-28 10:33:55,228 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 1 [2018-11-28 10:33:55,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:55,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:56,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:56,429 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 0 case distinctions, treesize of input 117 treesize of output 121 [2018-11-28 10:33:56,433 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 1 [2018-11-28 10:33:56,433 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:56,460 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,134 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 84 treesize of output 75 [2018-11-28 10:33:57,137 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 1 [2018-11-28 10:33:57,138 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,155 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:57,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2018-11-28 10:33:57,536 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 1 [2018-11-28 10:33:57,536 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,825 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 109 [2018-11-28 10:33:57,830 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 105 treesize of output 81 [2018-11-28 10:33:57,830 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:57,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:58,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 96 [2018-11-28 10:33:58,007 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-28 10:33:58,147 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:33:58,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2018-11-28 10:33:58,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:58,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-11-28 10:33:58,175 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:58,205 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:58,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:33:58,388 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:418, output treesize:272 [2018-11-28 10:33:59,635 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-28 10:33:59,766 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2018-11-28 10:33:59,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:59,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:59,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:33:59,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 10:33:59,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:33:59,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:33:59,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:312, output treesize:95 [2018-11-28 10:34:00,189 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 43 treesize of output 33 [2018-11-28 10:34:00,194 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 33 treesize of output 20 [2018-11-28 10:34:00,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:00,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:00,252 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 65 treesize of output 49 [2018-11-28 10:34:00,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2018-11-28 10:34:00,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:34:00,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:34:00,293 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-11-28 10:34:00,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:30 [2018-11-28 10:34:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:00,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:00,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:00,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:34:00,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:34:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:34:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:34:00,537 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-11-28 10:34:26,594 WARN L180 SmtUtils]: Spent 22.88 s on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2018-11-28 10:34:29,376 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 10:34:29,962 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-28 10:34:30,535 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-28 10:34:31,635 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-28 10:34:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:31,911 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-28 10:34:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 10:34:31,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-28 10:34:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:31,912 INFO L225 Difference]: With dead ends: 48 [2018-11-28 10:34:31,912 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 10:34:31,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-11-28 10:34:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 10:34:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-28 10:34:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 10:34:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-28 10:34:31,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-11-28 10:34:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:31,915 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-28 10:34:31,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:34:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-28 10:34:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:34:31,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:31,916 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-11-28 10:34:31,916 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:34:31,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-11-28 10:34:31,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:34:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 10:34:31,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:32,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:32,054 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-11-28 10:34:32,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:34:32,095 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-11-28 10:34:32,097 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-11-28 10:34:32,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-28 10:34:32,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,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, 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-11-28 10:34:32,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-11-28 10:34:32,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-28 10:34:32,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,181 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 18 treesize of output 25 [2018-11-28 10:34:32,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-11-28 10:34:32,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 55 [2018-11-28 10:34:32,298 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 51 treesize of output 31 [2018-11-28 10:34:32,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 56 [2018-11-28 10:34:32,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 10:34:32,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:34:32,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:34:32,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-11-28 10:34:32,538 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 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-28 10:34:32,540 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 1 [2018-11-28 10:34:32,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,638 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 0 case distinctions, treesize of input 62 treesize of output 56 [2018-11-28 10:34:32,641 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 1 [2018-11-28 10:34:32,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,722 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 62 [2018-11-28 10:34:32,726 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 58 treesize of output 34 [2018-11-28 10:34:32,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:32,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:32,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 45 [2018-11-28 10:34:32,787 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 10:34:32,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:34:32,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 10:34:32,946 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:188, output treesize:129 [2018-11-28 10:34:33,045 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:34:33,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:33,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:33,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:33,066 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-11-28 10:34:33,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:33,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:33,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2018-11-28 10:34:33,194 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 27 [2018-11-28 10:34:33,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-28 10:34:33,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:33,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:33,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-11-28 10:34:33,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2018-11-28 10:34:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:33,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:33,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:33,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:34:33,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:34:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:34:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:34:33,252 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-11-28 10:34:34,160 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-28 10:34:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:35,055 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-28 10:34:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 10:34:35,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-28 10:34:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:35,056 INFO L225 Difference]: With dead ends: 47 [2018-11-28 10:34:35,056 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 10:34:35,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-11-28 10:34:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 10:34:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-28 10:34:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 10:34:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-28 10:34:35,058 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-11-28 10:34:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:35,058 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-28 10:34:35,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:34:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-28 10:34:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:34:35,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:35,059 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-11-28 10:34:35,059 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:34:35,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-11-28 10:34:35,059 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:34:35,059 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:34:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:35,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:35,220 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-11-28 10:34:35,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:34:35,243 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-11-28 10:34:35,245 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-11-28 10:34:35,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-28 10:34:35,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:35,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:35,274 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-11-28 10:34:35,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,290 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 6 treesize of output 5 [2018-11-28 10:34:35,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2018-11-28 10:34:35,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 10:34:35,334 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 10 treesize of output 9 [2018-11-28 10:34:35,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-28 10:34:35,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:35,375 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 18 treesize of output 25 [2018-11-28 10:34:35,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:46 [2018-11-28 10:34:35,513 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 37 treesize of output 53 [2018-11-28 10:34:35,517 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 38 treesize of output 18 [2018-11-28 10:34:35,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,576 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 2 case distinctions, treesize of input 35 treesize of output 27 [2018-11-28 10:34:35,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:34:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:34:35,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2018-11-28 10:34:35,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2018-11-28 10:34:35,680 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:34:35,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:34:35,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 73 [2018-11-28 10:34:35,763 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 71 treesize of output 51 [2018-11-28 10:34:35,764 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:35,885 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 56 [2018-11-28 10:34:35,886 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:34:35,947 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 10:34:36,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:34:36,027 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:100, output treesize:158 [2018-11-28 10:34:36,182 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-11-28 10:34:36,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2018-11-28 10:34:36,340 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 1 [2018-11-28 10:34:36,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:36,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:37,503 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 92 treesize of output 83 [2018-11-28 10:34:37,507 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 1 [2018-11-28 10:34:37,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:37,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,076 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 62 [2018-11-28 10:34:38,081 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 60 treesize of output 36 [2018-11-28 10:34:38,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:38,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 57 [2018-11-28 10:34:38,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 10:34:38,222 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:34:38,601 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 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-28 10:34:38,604 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 1 [2018-11-28 10:34:38,605 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,784 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 0 case distinctions, treesize of input 106 treesize of output 100 [2018-11-28 10:34:38,787 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 1 [2018-11-28 10:34:38,787 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,805 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-11-28 10:34:38,899 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 1 [2018-11-28 10:34:38,899 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,910 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:38,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:34:38,969 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:301, output treesize:127 [2018-11-28 10:34:39,264 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:34:39,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:39,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:39,291 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-11-28 10:34:39,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:167, output treesize:42 [2018-11-28 10:34:39,456 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-11-28 10:34:39,458 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-11-28 10:34:39,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,472 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 33 treesize of output 25 [2018-11-28 10:34:39,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-28 10:34:39,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:39,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2018-11-28 10:34:39,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-11-28 10:34:39,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:34:39,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:34:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:34:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:34:39,562 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-11-28 10:34:40,300 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-11-28 10:34:40,572 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-11-28 10:34:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:34:45,604 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 10:34:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:34:45,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-28 10:34:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:34:45,605 INFO L225 Difference]: With dead ends: 45 [2018-11-28 10:34:45,605 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 10:34:45,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2018-11-28 10:34:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 10:34:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 10:34:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 10:34:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-28 10:34:45,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 27 [2018-11-28 10:34:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:34:45,608 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-28 10:34:45,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:34:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-28 10:34:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 10:34:45,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:34:45,609 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] [2018-11-28 10:34:45,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:34:45,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:34:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-11-28 10:34:45,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:34:45,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 10:34:45,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:34:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:34:45,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:34:45,842 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-11-28 10:34:45,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:45,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:45,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:34:45,905 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-11-28 10:34:45,909 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-11-28 10:34:45,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:45,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:45,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:45,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-11-28 10:34:46,038 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-28 10:34:46,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,047 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 38 treesize of output 57 [2018-11-28 10:34:46,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-11-28 10:34:46,223 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 70 [2018-11-28 10:34:46,234 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 68 treesize of output 48 [2018-11-28 10:34:46,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,320 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 50 [2018-11-28 10:34:46,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:34:46,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 10:34:46,408 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 3 xjuncts. [2018-11-28 10:34:46,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:100 [2018-11-28 10:34:46,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,603 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 0 case distinctions, treesize of input 53 treesize of output 57 [2018-11-28 10:34:46,607 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 1 [2018-11-28 10:34:46,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,784 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2018-11-28 10:34:46,789 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 55 treesize of output 31 [2018-11-28 10:34:46,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:46,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 46 [2018-11-28 10:34:46,879 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-28 10:34:46,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:34:46,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:46,997 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 0 case distinctions, treesize of input 73 treesize of output 77 [2018-11-28 10:34:47,000 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 1 [2018-11-28 10:34:47,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:47,011 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:47,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 10:34:47,048 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:181, output treesize:105 [2018-11-28 10:34:49,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:49,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:49,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:49,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-11-28 10:34:49,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:133, output treesize:36 [2018-11-28 10:34:49,525 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 43 treesize of output 31 [2018-11-28 10:34:49,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-11-28 10:34:49,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-11-28 10:34:49,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:34:49,640 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-11-28 10:34:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:34:49,645 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-11-28 10:34:49,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 10:34:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:34:49,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:34:49,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:34:49,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 10:34:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 10:34:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 10:34:49,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=371, Unknown=1, NotChecked=0, Total=420 [2018-11-28 10:34:49,698 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-11-28 10:34:52,913 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2018-11-28 10:35:02,082 WARN L180 SmtUtils]: Spent 9.08 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-28 10:35:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:03,562 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-28 10:35:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 10:35:03,562 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-11-28 10:35:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:03,563 INFO L225 Difference]: With dead ends: 44 [2018-11-28 10:35:03,563 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 10:35:03,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=161, Invalid=1098, Unknown=1, NotChecked=0, Total=1260 [2018-11-28 10:35:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 10:35:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-28 10:35:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 10:35:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-28 10:35:03,564 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-11-28 10:35:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:03,565 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-28 10:35:03,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 10:35:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-28 10:35:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 10:35:03,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:03,565 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-11-28 10:35:03,565 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:35:03,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-11-28 10:35:03,566 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:35:03,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:35:03,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:35:03,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:35:03,764 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-11-28 10:35:03,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:35:03,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-11-28 10:35:03,792 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-11-28 10:35:03,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-28 10:35:03,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:03,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:03,821 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-11-28 10:35:03,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-11-28 10:35:03,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-28 10:35:03,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:03,859 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 18 treesize of output 25 [2018-11-28 10:35:03,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:03,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-11-28 10:35:03,976 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-11-28 10:35:03,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:03,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:04,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 46 [2018-11-28 10:35:04,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-28 10:35:04,082 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 40 treesize of output 20 [2018-11-28 10:35:04,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:35:04,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:35:04,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-11-28 10:35:04,263 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 0 case distinctions, treesize of input 60 treesize of output 54 [2018-11-28 10:35:04,266 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 1 [2018-11-28 10:35:04,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,401 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2018-11-28 10:35:04,404 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 54 treesize of output 30 [2018-11-28 10:35:04,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2018-11-28 10:35:04,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-28 10:35:04,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:35:04,581 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 0 case distinctions, treesize of input 56 treesize of output 50 [2018-11-28 10:35:04,584 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 1 [2018-11-28 10:35:04,584 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 10:35:04,644 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:170, output treesize:84 [2018-11-28 10:35:04,707 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:35:04,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:04,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:04,719 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-11-28 10:35:04,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:29 [2018-11-28 10:35:04,898 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 23 [2018-11-28 10:35:04,903 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 23 treesize of output 9 [2018-11-28 10:35:04,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-11-28 10:35:04,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:35:04,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-11-28 10:35:04,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:04,984 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-11-28 10:35:04,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-11-28 10:35:05,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 25 [2018-11-28 10:35:05,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:35:05,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:35:05,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-11-28 10:35:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:35:05,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 10:35:05,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:35:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 10:35:05,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 10:35:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 10:35:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:35:05,104 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-11-28 10:35:05,787 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-28 10:35:06,183 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-11-28 10:35:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:35:07,417 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-28 10:35:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 10:35:07,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-11-28 10:35:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:35:07,418 INFO L225 Difference]: With dead ends: 44 [2018-11-28 10:35:07,418 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 10:35:07,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 10:35:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 10:35:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-28 10:35:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 10:35:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-28 10:35:07,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-11-28 10:35:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:35:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-28 10:35:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 10:35:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-28 10:35:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 10:35:07,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:35:07,422 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-11-28 10:35:07,422 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 10:35:07,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:35:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-11-28 10:35:07,422 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 10:35:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59b16647-9771-4ade-8623-f5da8c655c8f/bin-2019/uautomizer/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-11-28 10:35:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:35:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:35:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:35:07,888 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:35:07,902 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 10:35:07,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:35:07 BoogieIcfgContainer [2018-11-28 10:35:07,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:35:07,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:35:07,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:35:07,917 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:35:07,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:39" (3/4) ... [2018-11-28 10:35:07,920 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:35:07,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:35:07,921 INFO L168 Benchmark]: Toolchain (without parser) took 88918.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 938.0 MB in the beginning and 932.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 309.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:35:07,921 INFO L168 Benchmark]: CDTParser took 0.17 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-11-28 10:35:07,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:35:07,921 INFO L168 Benchmark]: Boogie Preprocessor took 40.63 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-11-28 10:35:07,922 INFO L168 Benchmark]: RCFGBuilder took 423.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:35:07,922 INFO L168 Benchmark]: TraceAbstraction took 88101.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 932.8 MB in the end (delta: 139.1 MB). Peak memory consumption was 300.1 MB. Max. memory is 11.5 GB. [2018-11-28 10:35:07,922 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.3 GB. Free memory is still 932.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:35:07,923 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.17 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 343.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.63 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. * RCFGBuilder took 423.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88101.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 932.8 MB in the end (delta: 139.1 MB). Peak memory consumption was 300.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.3 GB. Free memory is still 932.8 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: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-1340582773:0}] [L643] CALL alloc_data(&data) VAL [pdata={-1340582773:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->lo={-1323805559:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->lo={-1323805559:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->hi={-1323805686:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->hi={-1323805686:0}] [L643] RET alloc_data(&data) VAL [data={-1340582773:0}] [L644] CALL free_data(&data) VAL [data={-1340582773:0}] [L632] EXPR data->lo VAL [data={-1340582773:0}, data={-1340582773:0}, data->lo={-1323805559:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-1340582773:0}, data={-1340582773:0}, data->hi={-1323805686:0}, lo={-1323805559:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L639] data->hi = ((void *)0) VAL [data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L644] RET free_data(&data) VAL [data={-1340582773:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 88.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 61.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 626 SDslu, 2145 SDs, 0 SdLazy, 3323 SolverSat, 211 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 57.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, 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, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 287 ConstructedInterpolants, 33 QuantifiedInterpolants, 195500 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1517 ConjunctsInSsa, 319 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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...