./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-635dfa2 [2018-12-08 22:12:25,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:12:25,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:12:25,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:12:25,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:12:25,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:12:25,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:12:25,296 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:12:25,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:12:25,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:12:25,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:12:25,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:12:25,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:12:25,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:12:25,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:12:25,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:12:25,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:12:25,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:12:25,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:12:25,303 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:12:25,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:12:25,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:12:25,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:12:25,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:12:25,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:12:25,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:12:25,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:12:25,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:12:25,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:12:25,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:12:25,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:12:25,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:12:25,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:12:25,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:12:25,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:12:25,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:12:25,309 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 22:12:25,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:12:25,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:12:25,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:12:25,317 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:12:25,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:12:25,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:12:25,317 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 22:12:25,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:12:25,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:12:25,317 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:12:25,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:12:25,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:12:25,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:12:25,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:12:25,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:12:25,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:12:25,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 22:12:25,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:12:25,319 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_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:25,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:12:25,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:12:25,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:12:25,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:12:25,349 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:12:25,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:25,388 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/eb86781e7/2f285aca04774c6eb0f8d19aab0580ca/FLAG253fe8a77 [2018-12-08 22:12:25,792 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:12:25,792 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:25,798 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/eb86781e7/2f285aca04774c6eb0f8d19aab0580ca/FLAG253fe8a77 [2018-12-08 22:12:25,806 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/eb86781e7/2f285aca04774c6eb0f8d19aab0580ca [2018-12-08 22:12:25,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:12:25,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 22:12:25,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:25,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:12:25,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:12:25,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:25" (1/1) ... [2018-12-08 22:12:25,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da7353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:25, skipping insertion in model container [2018-12-08 22:12:25,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:25" (1/1) ... [2018-12-08 22:12:25,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:12:25,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:12:25,972 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:25,978 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:12:26,037 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:26,058 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:12:26,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26 WrapperNode [2018-12-08 22:12:26,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:26,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:12:26,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:12:26,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:12:26,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... [2018-12-08 22:12:26,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:12:26,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:12:26,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:12:26,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:12:26,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:26,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:12:26,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:12:26,117 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-08 22:12:26,117 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-08 22:12:26,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:12:26,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 22:12:26,118 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 22:12:26,119 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 22:12:26,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 22:12:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 22:12:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 22:12:26,123 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 22:12:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 22:12:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:12:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:12:26,359 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:12:26,359 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 22:12:26,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:26 BoogieIcfgContainer [2018-12-08 22:12:26,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:12:26,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:12:26,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:12:26,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:12:26,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:12:25" (1/3) ... [2018-12-08 22:12:26,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75addf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:12:26, skipping insertion in model container [2018-12-08 22:12:26,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:26" (2/3) ... [2018-12-08 22:12:26,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75addf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:12:26, skipping insertion in model container [2018-12-08 22:12:26,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:26" (3/3) ... [2018-12-08 22:12:26,363 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:26,369 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:12:26,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-08 22:12:26,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-08 22:12:26,396 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 22:12:26,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:12:26,396 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 22:12:26,397 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:12:26,397 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:12:26,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:12:26,397 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:12:26,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:12:26,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:12:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 22:12:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:12:26,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:26,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:26,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:26,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-12-08 22:12:26,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:26,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:26,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:26,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:12:26,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:12:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:12:26,549 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-08 22:12:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:26,655 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-08 22:12:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:26,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:12:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:26,664 INFO L225 Difference]: With dead ends: 66 [2018-12-08 22:12:26,664 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 22:12:26,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 22:12:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 22:12:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 22:12:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-08 22:12:26,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-08 22:12:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:26,690 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-08 22:12:26,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:12:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-08 22:12:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:12:26,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:26,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:26,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-12-08 22:12:26,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:26,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:26,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:12:26,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:12:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:12:26,754 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-08 22:12:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:26,859 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-08 22:12:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:26,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:12:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:26,861 INFO L225 Difference]: With dead ends: 62 [2018-12-08 22:12:26,861 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 22:12:26,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 22:12:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-08 22:12:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 22:12:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-08 22:12:26,865 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-08 22:12:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:26,865 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-08 22:12:26,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:12:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-08 22:12:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:12:26,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:26,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:26,866 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:26,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-12-08 22:12:26,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:12:26,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:12:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:12:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:12:26,936 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 7 states. [2018-12-08 22:12:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:27,022 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:12:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:27,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-08 22:12:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:27,022 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:12:27,022 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:12:27,023 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-12-08 22:12:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:12:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 22:12:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 22:12:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-08 22:12:27,026 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-08 22:12:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:27,026 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-08 22:12:27,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:12:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-08 22:12:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:12:27,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:27,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:27,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:27,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-12-08 22:12:27,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:27,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:27,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:27,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:12:27,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:12:27,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:12:27,065 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 5 states. [2018-12-08 22:12:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:27,134 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-08 22:12:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:12:27,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 22:12:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:27,135 INFO L225 Difference]: With dead ends: 58 [2018-12-08 22:12:27,135 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 22:12:27,135 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-12-08 22:12:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 22:12:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 22:12:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 22:12:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-08 22:12:27,138 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-08 22:12:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:27,138 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-08 22:12:27,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:12:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-08 22:12:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:12:27,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:27,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:27,139 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:27,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-12-08 22:12:27,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:27,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:27,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:27,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:12:27,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:12:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:12:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:27,215 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 6 states. [2018-12-08 22:12:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:27,341 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-08 22:12:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:12:27,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-08 22:12:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:27,342 INFO L225 Difference]: With dead ends: 57 [2018-12-08 22:12:27,342 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 22:12:27,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:12:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 22:12:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 22:12:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 22:12:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-08 22:12:27,344 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-08 22:12:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:27,345 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-08 22:12:27,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:12:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-08 22:12:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:12:27,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:27,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:27,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-12-08 22:12:27,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:27,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:27,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 22:12:27,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:12:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:12:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:12:27,442 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2018-12-08 22:12:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:27,625 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-08 22:12:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:12:27,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-08 22:12:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:27,625 INFO L225 Difference]: With dead ends: 56 [2018-12-08 22:12:27,626 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 22:12:27,626 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-12-08 22:12:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 22:12:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 22:12:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 22:12:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-08 22:12:27,628 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-08 22:12:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:27,628 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-08 22:12:27,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:12:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-08 22:12:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:12:27,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:27,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:27,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:27,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-12-08 22:12:27,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:27,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:27,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 22:12:27,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:12:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:12:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:12:27,755 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 11 states. [2018-12-08 22:12:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:27,965 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-08 22:12:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:12:27,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-08 22:12:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:27,966 INFO L225 Difference]: With dead ends: 55 [2018-12-08 22:12:27,966 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 22:12:27,966 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-12-08 22:12:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 22:12:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 22:12:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 22:12:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-08 22:12:27,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-08 22:12:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:27,968 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-08 22:12:27,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:12:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-08 22:12:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:12:27,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:27,969 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-12-08 22:12:27,969 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:27,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-12-08 22:12:27,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:28,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:12:28,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:12:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:12:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:12:28,003 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 8 states. [2018-12-08 22:12:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:28,080 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:12:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:12:28,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-08 22:12:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:28,081 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:12:28,081 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:12:28,081 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-12-08 22:12:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:12:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-08 22:12:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 22:12:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-08 22:12:28,085 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-08 22:12:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:28,085 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-08 22:12:28,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:12:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-08 22:12:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:12:28,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:28,086 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-12-08 22:12:28,087 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:28,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-12-08 22:12:28,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:28,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:28,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:12:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:12:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:12:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:12:28,191 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 9 states. [2018-12-08 22:12:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:28,265 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-08 22:12:28,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:12:28,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-08 22:12:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:28,266 INFO L225 Difference]: With dead ends: 49 [2018-12-08 22:12:28,266 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 22:12:28,266 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-12-08 22:12:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 22:12:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-08 22:12:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 22:12:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 22:12:28,268 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-08 22:12:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:28,268 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-08 22:12:28,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:12:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 22:12:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:12:28,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:28,269 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-12-08 22:12:28,269 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:28,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-12-08 22:12:28,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:28,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:28,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:28,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 22:12:28,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 22:12:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 22:12:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-12-08 22:12:28,540 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2018-12-08 22:12:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:29,185 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-08 22:12:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 22:12:29,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-08 22:12:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:29,187 INFO L225 Difference]: With dead ends: 50 [2018-12-08 22:12:29,188 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 22:12:29,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 22:12:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 22:12:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-08 22:12:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 22:12:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 22:12:29,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-08 22:12:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:29,191 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-08 22:12:29,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 22:12:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 22:12:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:12:29,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:29,191 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-12-08 22:12:29,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:29,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-12-08 22:12:29,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:29,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:29,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:29,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:12:29,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:12:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:12:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:12:29,510 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-08 22:12:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:30,158 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-08 22:12:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:12:30,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:12:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:30,160 INFO L225 Difference]: With dead ends: 48 [2018-12-08 22:12:30,160 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 22:12:30,161 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-12-08 22:12:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 22:12:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-08 22:12:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 22:12:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 22:12:30,167 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-08 22:12:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:30,167 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-08 22:12:30,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:12:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 22:12:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:12:30,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:30,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:30,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:30,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-12-08 22:12:30,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:30,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:30,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:30,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:12:30,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:12:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:12:30,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:12:30,523 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-08 22:12:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:31,200 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-08 22:12:31,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:12:31,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:12:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:31,201 INFO L225 Difference]: With dead ends: 47 [2018-12-08 22:12:31,201 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 22:12:31,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-12-08 22:12:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 22:12:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-08 22:12:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 22:12:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-08 22:12:31,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-12-08 22:12:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:31,204 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-08 22:12:31,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:12:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-08 22:12:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:12:31,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:31,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:31,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-12-08 22:12:31,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:31,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:31,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 22:12:31,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 22:12:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 22:12:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-12-08 22:12:31,521 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-12-08 22:12:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:32,216 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-08 22:12:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 22:12:32,216 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-08 22:12:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:32,216 INFO L225 Difference]: With dead ends: 43 [2018-12-08 22:12:32,216 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 22:12:32,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-12-08 22:12:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 22:12:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-08 22:12:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 22:12:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-08 22:12:32,218 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 27 [2018-12-08 22:12:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-08 22:12:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 22:12:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-08 22:12:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 22:12:32,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:32,219 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-12-08 22:12:32,219 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:32,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1829250660, now seen corresponding path program 1 times [2018-12-08 22:12:32,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:32,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:32,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:32,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 22:12:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 22:12:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 22:12:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-08 22:12:32,611 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2018-12-08 22:12:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:33,390 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-08 22:12:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 22:12:33,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-12-08 22:12:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:33,391 INFO L225 Difference]: With dead ends: 45 [2018-12-08 22:12:33,391 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 22:12:33,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 22:12:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 22:12:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-08 22:12:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 22:12:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 22:12:33,394 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-12-08 22:12:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-08 22:12:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 22:12:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 22:12:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 22:12:33,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:33,395 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-12-08 22:12:33,395 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:33,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-12-08 22:12:33,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:33,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:33,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:33,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:12:33,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:12:33,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:12:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:12:33,870 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-08 22:12:34,295 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-12-08 22:12:34,730 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-08 22:12:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:35,329 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:12:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 22:12:35,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-08 22:12:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:35,330 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:12:35,330 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:12:35,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 22:12:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:12:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-08 22:12:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 22:12:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 22:12:35,332 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-08 22:12:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:35,332 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-08 22:12:35,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:12:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 22:12:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 22:12:35,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:35,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:35,333 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:35,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-12-08 22:12:35,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:12:35,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:12:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:12:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:12:35,662 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-08 22:12:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:36,321 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-08 22:12:36,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 22:12:36,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-08 22:12:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:36,322 INFO L225 Difference]: With dead ends: 43 [2018-12-08 22:12:36,322 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 22:12:36,323 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-12-08 22:12:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 22:12:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-08 22:12:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 22:12:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 22:12:36,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-08 22:12:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:36,325 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-08 22:12:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:12:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 22:12:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 22:12:36,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:36,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:36,326 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION]=== [2018-12-08 22:12:36,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-12-08 22:12:36,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:12:36,373 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 22:12:36,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:12:36 BoogieIcfgContainer [2018-12-08 22:12:36,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:12:36,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:12:36,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:12:36,382 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:12:36,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:26" (3/4) ... [2018-12-08 22:12:36,385 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:12:36,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:12:36,385 INFO L168 Benchmark]: Toolchain (without parser) took 10576.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -256.5 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:36,386 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:12:36,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:36,386 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:12:36,386 INFO L168 Benchmark]: RCFGBuilder took 273.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:36,386 INFO L168 Benchmark]: TraceAbstraction took 10022.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:36,387 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:12:36,388 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10022.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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))={11:0}, malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={11:0}, malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={11:0}, malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={11:0}, malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={11:0}, malloc(sizeof(int))={10: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.6s 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.6s 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, 2.9s 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-635dfa2 [2018-12-08 22:12:37,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:12:37,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:12:37,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:12:37,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:12:37,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:12:37,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:12:37,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:12:37,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:12:37,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:12:37,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:12:37,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:12:37,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:12:37,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:12:37,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:12:37,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:12:37,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:12:37,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:12:37,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:12:37,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:12:37,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:12:37,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:12:37,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:12:37,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:12:37,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:12:37,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:12:37,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:12:37,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:12:37,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:12:37,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:12:37,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:12:37,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:12:37,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:12:37,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:12:37,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:12:37,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:12:37,685 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-08 22:12:37,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:12:37,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:12:37,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:12:37,693 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:12:37,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:12:37,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:12:37,693 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 22:12:37,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:12:37,694 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:12:37,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:12:37,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:12:37,695 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 22:12:37,695 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_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:37,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:12:37,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:12:37,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:12:37,723 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:12:37,724 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:12:37,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:37,759 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/e67374829/a550123f0d3344b1a00724cb44366974/FLAGb142725ee [2018-12-08 22:12:38,200 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:12:38,201 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:38,208 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/e67374829/a550123f0d3344b1a00724cb44366974/FLAGb142725ee [2018-12-08 22:12:38,216 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/bin-2019/uautomizer/data/e67374829/a550123f0d3344b1a00724cb44366974 [2018-12-08 22:12:38,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:12:38,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 22:12:38,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:38,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:12:38,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:12:38,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39933d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38, skipping insertion in model container [2018-12-08 22:12:38,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:12:38,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:12:38,391 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:38,399 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:12:38,426 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:38,449 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:12:38,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38 WrapperNode [2018-12-08 22:12:38,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:38,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:12:38,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:12:38,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:12:38,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... [2018-12-08 22:12:38,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:12:38,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:12:38,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:12:38,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:12:38,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:12:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:12:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-08 22:12:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-08 22:12:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:12:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 22:12:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 22:12:38,541 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 22:12:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 22:12:38,543 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 22:12:38,544 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 22:12:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 22:12:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 22:12:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 22:12:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 22:12:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 22:12:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 22:12:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:12:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:12:38,844 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:12:38,844 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 22:12:38,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:38 BoogieIcfgContainer [2018-12-08 22:12:38,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:12:38,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:12:38,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:12:38,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:12:38,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:12:38" (1/3) ... [2018-12-08 22:12:38,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e6d34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:12:38, skipping insertion in model container [2018-12-08 22:12:38,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:38" (2/3) ... [2018-12-08 22:12:38,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e6d34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:12:38, skipping insertion in model container [2018-12-08 22:12:38,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:38" (3/3) ... [2018-12-08 22:12:38,850 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:12:38,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:12:38,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-08 22:12:38,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-08 22:12:38,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 22:12:38,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:12:38,886 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 22:12:38,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:12:38,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:12:38,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:12:38,886 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:12:38,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:12:38,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:12:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 22:12:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:12:38,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:38,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:38,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:38,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-12-08 22:12:38,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:38,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:38,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:38,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:38,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 22:12:39,018 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-12-08 22:12:39,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:39,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-08 22:12:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:39,034 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:39,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:12:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:12:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:12:39,047 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-08 22:12:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:39,281 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-08 22:12:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:39,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:12:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:39,288 INFO L225 Difference]: With dead ends: 66 [2018-12-08 22:12:39,288 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 22:12:39,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 22:12:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 22:12:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 22:12:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-08 22:12:39,313 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-08 22:12:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:39,314 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-08 22:12:39,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:12:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-08 22:12:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:12:39,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:39,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:39,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:39,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-12-08 22:12:39,315 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:39,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:39,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:39,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:39,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 22:12:39,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 22:12:39,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 22:12:39,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:39,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-12-08 22:12:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:39,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:39,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:12:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:12:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:12:39,453 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-08 22:12:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:39,709 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-08 22:12:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:39,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:12:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:39,710 INFO L225 Difference]: With dead ends: 62 [2018-12-08 22:12:39,710 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 22:12:39,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 22:12:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-08 22:12:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 22:12:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-08 22:12:39,714 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-08 22:12:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:39,714 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-08 22:12:39,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:12:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-08 22:12:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:12:39,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:39,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:39,715 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:39,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-12-08 22:12:39,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:39,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:39,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:39,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:39,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:39,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 22:12:39,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:12:39,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 22:12:39,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:39,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-08 22:12:39,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:12:39,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:39,890 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-12-08 22:12:39,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:39,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:39,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2018-12-08 22:12:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:39,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:39,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:12:39,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:12:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:12:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:12:39,913 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2018-12-08 22:12:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,139 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:12:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:12:40,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-08 22:12:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:40,140 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:12:40,141 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:12:40,141 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-12-08 22:12:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:12:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 22:12:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 22:12:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-08 22:12:40,144 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-08 22:12:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:40,144 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-08 22:12:40,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:12:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-08 22:12:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:12:40,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:40,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:40,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-12-08 22:12:40,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:40,145 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:40,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:40,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:40,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:12:40,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:12:40,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:40,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-12-08 22:12:40,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,250 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-12-08 22:12:40,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2018-12-08 22:12:40,289 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-12-08 22:12:40,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,293 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-12-08 22:12:40,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-12-08 22:12:40,347 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-12-08 22:12:40,350 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-12-08 22:12:40,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:40,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:40,368 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-12-08 22:12:40,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2018-12-08 22:12:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:40,388 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:12:40,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:12:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:12:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:12:40,390 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-12-08 22:12:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,821 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-08 22:12:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:12:40,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-08 22:12:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:40,822 INFO L225 Difference]: With dead ends: 58 [2018-12-08 22:12:40,822 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 22:12:40,822 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-12-08 22:12:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 22:12:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 22:12:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 22:12:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-08 22:12:40,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-08 22:12:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:40,825 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-08 22:12:40,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:12:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-08 22:12:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:12:40,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:40,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:40,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-12-08 22:12:40,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:40,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:40,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:40,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 6 treesize of output 5 [2018-12-08 22:12:40,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:40,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-08 22:12:40,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:12:40,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:40,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:12:40,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:40,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:40,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-12-08 22:12:40,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:40,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-08 22:12:40,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 22:12:41,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2018-12-08 22:12:41,052 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-12-08 22:12:41,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:41,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 22:12:41,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,097 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-12-08 22:12:41,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:41,101 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-12-08 22:12:41,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2018-12-08 22:12:41,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:12:41,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 22:12:41,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,170 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-12-08 22:12:41,172 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-12-08 22:12:41,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:41,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:41,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:41,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2018-12-08 22:12:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:41,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:12:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:12:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:12:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:12:41,207 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 9 states. [2018-12-08 22:12:41,525 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-08 22:12:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:41,839 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-08 22:12:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:12:41,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-08 22:12:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:41,840 INFO L225 Difference]: With dead ends: 57 [2018-12-08 22:12:41,840 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 22:12:41,841 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-12-08 22:12:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 22:12:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 22:12:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 22:12:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-08 22:12:41,843 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-08 22:12:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:41,843 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-08 22:12:41,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:12:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-08 22:12:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:12:41,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:41,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:41,844 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:41,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-12-08 22:12:41,844 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:41,844 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:41,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:41,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:41,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:41,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:12:41,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:41,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:41,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 22:12:41,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 22:12:41,955 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-12-08 22:12:41,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:41,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-08 22:12:41,981 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-12-08 22:12:41,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:41,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2018-12-08 22:12:42,006 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-12-08 22:12:42,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:42,012 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-12-08 22:12:42,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-08 22:12:42,078 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-12-08 22:12:42,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 20 treesize of output 1 [2018-12-08 22:12:42,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2018-12-08 22:12:42,095 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-12-08 22:12:42,099 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-12-08 22:12:42,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:42,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-12-08 22:12:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:42,119 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:42,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:42,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:12:42,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:12:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:12:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:12:42,121 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 10 states. [2018-12-08 22:12:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:42,528 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-08 22:12:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:12:42,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-08 22:12:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:42,529 INFO L225 Difference]: With dead ends: 56 [2018-12-08 22:12:42,529 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 22:12:42,529 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-12-08 22:12:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 22:12:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 22:12:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 22:12:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-08 22:12:42,532 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-08 22:12:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:42,532 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-08 22:12:42,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:12:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-08 22:12:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:12:42,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:42,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:42,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:42,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-12-08 22:12:42,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:42,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:42,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:42,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:42,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:12:42,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:42,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:42,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 22:12:42,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 22:12:42,667 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-12-08 22:12:42,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:42,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-08 22:12:42,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:42,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 22:12:42,737 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-12-08 22:12:42,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:42,742 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-12-08 22:12:42,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,766 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-12-08 22:12:42,768 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-12-08 22:12:42,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-12-08 22:12:42,861 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-12-08 22:12:42,865 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-12-08 22:12:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,901 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-12-08 22:12:42,904 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-12-08 22:12:42,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-12-08 22:12:42,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:12:42,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 22:12:42,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,932 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-12-08 22:12:42,935 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-12-08 22:12:42,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:42,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-12-08 22:12:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:42,954 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:12:42,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:12:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:12:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:12:42,956 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 10 states. [2018-12-08 22:12:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:43,522 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-08 22:12:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:12:43,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-08 22:12:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:43,523 INFO L225 Difference]: With dead ends: 55 [2018-12-08 22:12:43,523 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 22:12:43,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:12:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 22:12:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 22:12:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 22:12:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-08 22:12:43,525 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-08 22:12:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:43,525 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-08 22:12:43,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:12:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-08 22:12:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:12:43,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:43,526 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-12-08 22:12:43,526 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:43,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-12-08 22:12:43,526 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:43,526 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:43,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:43,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:43,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 22:12:43,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:43,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:43,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-08 22:12:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:43,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:12:43,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:12:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:12:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:12:43,608 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 7 states. [2018-12-08 22:12:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:43,892 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:12:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:12:43,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-08 22:12:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:43,893 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:12:43,894 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:12:43,894 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-12-08 22:12:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:12:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-08 22:12:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 22:12:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-08 22:12:43,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-08 22:12:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:43,898 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-08 22:12:43,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:12:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-08 22:12:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:12:43,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:43,899 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-12-08 22:12:43,899 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:43,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-12-08 22:12:43,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:43,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:43,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:43,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:44,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:44,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:12:44,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:12:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:12:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:12:44,031 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 8 states. [2018-12-08 22:12:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:44,412 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-08 22:12:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:12:44,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-08 22:12:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:44,413 INFO L225 Difference]: With dead ends: 49 [2018-12-08 22:12:44,413 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 22:12:44,413 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-12-08 22:12:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 22:12:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-08 22:12:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 22:12:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 22:12:44,416 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-08 22:12:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:44,416 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-08 22:12:44,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:12:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 22:12:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:12:44,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:44,416 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-12-08 22:12:44,417 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:44,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-12-08 22:12:44,417 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:44,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:44,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:44,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:12:44,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:12:44,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:44,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:12:44,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:44,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:44,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:12:44,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:12:44,626 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-12-08 22:12:44,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:44,632 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-12-08 22:12:44,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-08 22:12:44,762 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-12-08 22:12:44,767 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-12-08 22:12:44,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:44,846 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-12-08 22:12:44,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 22:12:44,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:12:44,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:12:44,929 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:89 [2018-12-08 22:12:45,055 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-12-08 22:12:45,058 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-12-08 22:12:45,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,159 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-12-08 22:12:45,161 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-12-08 22:12:45,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,251 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-12-08 22:12:45,255 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-12-08 22:12:45,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:45,331 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-12-08 22:12:45,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:12:45,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:12:45,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 22:12:45,414 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2018-12-08 22:12:45,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:45,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:45,504 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-12-08 22:12:45,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-12-08 22:12:45,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12-08 22:12:45,628 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-12-08 22:12:45,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:45,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-12-08 22:12:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:45,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:45,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:45,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:12:45,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:12:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:12:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:12:45,685 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2018-12-08 22:12:48,430 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-12-08 22:12:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:49,134 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-08 22:12:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:12:49,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:12:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:12:49,136 INFO L225 Difference]: With dead ends: 50 [2018-12-08 22:12:49,136 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 22:12:49,136 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-12-08 22:12:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 22:12:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-08 22:12:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 22:12:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 22:12:49,138 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-08 22:12:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:12:49,138 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-08 22:12:49,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:12:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 22:12:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:12:49,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:12:49,139 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-12-08 22:12:49,139 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:12:49,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-12-08 22:12:49,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:12:49,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:12:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:49,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:12:49,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:49,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:12:49,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:12:49,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-12-08 22:12:49,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:12:49,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:12:49,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-12-08 22:12:49,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:49,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 22:12:49,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2018-12-08 22:12:49,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 13 treesize of output 10 [2018-12-08 22:12:49,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 10 treesize of output 9 [2018-12-08 22:12:49,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,463 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-12-08 22:12:49,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:49,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:49,471 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-12-08 22:12:49,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:66 [2018-12-08 22:12:49,669 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-12-08 22:12:49,681 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-12-08 22:12:49,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:49,899 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-12-08 22:12:49,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 22:12:50,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:12:50,184 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-12-08 22:12:50,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:50,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:50,195 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-12-08 22:12:50,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:50,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:50,271 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-12-08 22:12:50,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:50,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:50,315 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-12-08 22:12:50,316 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:12:50,601 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-12-08 22:12:50,602 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:50,724 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:12:50,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:12:50,871 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:173, output treesize:236 [2018-12-08 22:12:51,092 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 22:12:51,334 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-08 22:12:51,399 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-12-08 22:12:51,430 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-12-08 22:12:51,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 22:12:51,715 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-12-08 22:12:51,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:51,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:12:53,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:53,555 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-12-08 22:12:53,561 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-12-08 22:12:53,561 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:53,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:54,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:54,782 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-12-08 22:12:54,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-12-08 22:12:54,787 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:54,822 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:55,415 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-12-08 22:12:55,418 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-12-08 22:12:55,418 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:55,436 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:55,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:55,826 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-12-08 22:12:55,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 24 treesize of output 1 [2018-12-08 22:12:55,830 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:55,861 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:56,168 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-12-08 22:12:56,173 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-12-08 22:12:56,173 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:56,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:56,351 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-12-08 22:12:56,352 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-08 22:12:56,473 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:12:56,481 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-12-08 22:12:56,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:56,489 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-12-08 22:12:56,489 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:56,519 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:56,698 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-12-08 22:12:56,698 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:418, output treesize:272 [2018-12-08 22:12:57,632 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-12-08 22:12:57,755 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2018-12-08 22:12:57,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:57,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:57,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:12:57,762 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-12-08 22:12:57,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:57,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:57,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:312, output treesize:95 [2018-12-08 22:12:58,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 43 treesize of output 33 [2018-12-08 22:12:58,199 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-12-08 22:12:58,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:12:58,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:12:58,251 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-12-08 22:12:58,257 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-12-08 22:12:58,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:58,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:12:58,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-12-08 22:12:58,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:30 [2018-12-08 22:12:58,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-12-08 22:12:58,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:12:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:12:58,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:12:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:12:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:12:58,543 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-08 22:13:34,929 WARN L180 SmtUtils]: Spent 33.41 s on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2018-12-08 22:13:38,014 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-08 22:13:38,478 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-08 22:13:39,480 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-12-08 22:13:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:13:39,773 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-08 22:13:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 22:13:39,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:13:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:13:39,774 INFO L225 Difference]: With dead ends: 48 [2018-12-08 22:13:39,774 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 22:13:39,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-12-08 22:13:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 22:13:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-08 22:13:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 22:13:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 22:13:39,776 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-08 22:13:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:13:39,776 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-08 22:13:39,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:13:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 22:13:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:13:39,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:13:39,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:13:39,777 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:13:39,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:13:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-12-08 22:13:39,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:13:39,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:13:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:13:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:13:39,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:13:39,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:13:39,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:13:39,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:13:39,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:13:39,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:13:39,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:39,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:39,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:13:39,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:39,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:13:40,001 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-12-08 22:13:40,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:40,006 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-12-08 22:13:40,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-08 22:13:40,144 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-12-08 22:13:40,147 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-12-08 22:13:40,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:40,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:40,221 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-12-08 22:13:40,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 22:13:40,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:13:40,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:13:40,286 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-12-08 22:13:40,403 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-12-08 22:13:40,406 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-12-08 22:13:40,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,512 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-12-08 22:13:40,514 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-12-08 22:13:40,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,605 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-12-08 22:13:40,609 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-12-08 22:13:40,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:40,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:40,675 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-12-08 22:13:40,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:13:40,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:13:40,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 22:13:40,931 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:188, output treesize:129 [2018-12-08 22:13:41,041 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 22:13:41,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:41,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:41,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-08 22:13:41,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2018-12-08 22:13:41,269 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-12-08 22:13:41,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, 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-12-08 22:13:41,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:41,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2018-12-08 22:13:41,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-12-08 22:13:41,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:13:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:13:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:13:41,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:13:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:13:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:13:41,377 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-08 22:13:42,327 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-08 22:13:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:13:43,134 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-08 22:13:43,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:13:43,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:13:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:13:43,135 INFO L225 Difference]: With dead ends: 47 [2018-12-08 22:13:43,135 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 22:13:43,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-08 22:13:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 22:13:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-08 22:13:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 22:13:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-08 22:13:43,138 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-12-08 22:13:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:13:43,138 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-08 22:13:43,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:13:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-08 22:13:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:13:43,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:13:43,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:13:43,139 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:13:43,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:13:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-12-08 22:13:43,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:13:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:13:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:13:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:13:43,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:13:43,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:13:43,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:13:43,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:13:43,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:13:43,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:13:43,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:43,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:43,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:13:43,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,368 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-12-08 22:13:43,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2018-12-08 22:13:43,412 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-12-08 22:13:43,415 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-12-08 22:13:43,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,448 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-12-08 22:13:43,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:43,454 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-12-08 22:13:43,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:46 [2018-12-08 22:13:43,612 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-12-08 22:13:43,616 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-12-08 22:13:43,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,676 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-12-08 22:13:43,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 22:13:43,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:13:43,752 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-12-08 22:13:43,762 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-12-08 22:13:43,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:13:43,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:13:43,836 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-12-08 22:13:43,840 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-12-08 22:13:43,840 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:43,937 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-12-08 22:13:43,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:13:43,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:13:44,078 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-12-08 22:13:44,079 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:100, output treesize:158 [2018-12-08 22:13:44,226 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-08 22:13:44,348 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-12-08 22:13:44,351 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-12-08 22:13:44,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:44,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:45,066 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-12-08 22:13:45,069 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-12-08 22:13:45,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:45,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:45,552 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-12-08 22:13:45,555 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-12-08 22:13:45,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:45,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:45,631 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-12-08 22:13:45,632 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:13:45,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:13:46,009 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-12-08 22:13:46,012 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-12-08 22:13:46,012 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,183 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-12-08 22:13:46,187 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-12-08 22:13:46,187 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,207 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,303 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-12-08 22:13:46,307 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-12-08 22:13:46,307 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,317 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,374 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-12-08 22:13:46,374 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:301, output treesize:127 [2018-12-08 22:13:46,590 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 22:13:46,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:46,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:46,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-08 22:13:46,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:167, output treesize:42 [2018-12-08 22:13:46,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:13:46,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 22:13:46,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,817 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-12-08 22:13:46,820 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-12-08 22:13:46,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:46,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2018-12-08 22:13:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:13:46,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:13:46,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:13:46,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:13:46,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:13:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:13:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:13:46,899 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-12-08 22:13:47,893 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-08 22:13:48,162 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-08 22:13:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:13:49,187 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-08 22:13:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:13:49,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:13:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:13:49,189 INFO L225 Difference]: With dead ends: 45 [2018-12-08 22:13:49,189 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 22:13:49,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-12-08 22:13:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 22:13:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-08 22:13:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 22:13:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 22:13:49,191 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 27 [2018-12-08 22:13:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:13:49,191 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-08 22:13:49,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:13:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 22:13:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 22:13:49,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:13:49,192 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-12-08 22:13:49,193 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:13:49,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:13:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-12-08 22:13:49,193 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:13:49,193 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:13:49,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:13:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:13:49,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:13:49,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:13:49,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:13:49,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:13:49,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:13:49,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-12-08 22:13:49,458 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-12-08 22:13:49,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:49,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:49,463 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-12-08 22:13:49,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-12-08 22:13:49,595 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-12-08 22:13:49,606 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-12-08 22:13:49,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:49,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:49,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:49,682 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-12-08 22:13:49,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:13:49,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:13:49,763 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-12-08 22:13:49,764 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:100 [2018-12-08 22:13:51,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:51,935 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-12-08 22:13:51,938 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-12-08 22:13:51,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:51,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:52,082 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-12-08 22:13:52,086 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-12-08 22:13:52,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:52,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:52,160 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-12-08 22:13:52,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-08 22:13:52,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:13:52,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:52,264 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-12-08 22:13:52,267 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-12-08 22:13:52,267 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:52,276 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:52,310 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-12-08 22:13:52,310 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:181, output treesize:105 [2018-12-08 22:13:53,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:53,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:53,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:53,529 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-12-08 22:13:53,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:133, output treesize:36 [2018-12-08 22:13:53,750 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-12-08 22:13:53,752 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-12-08 22:13:53,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-12-08 22:13:53,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:13:53,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 22:13:53,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:13:53,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:13:53,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 22:13:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:13:53,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:13:53,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:13:53,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:13:53,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:13:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:13:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=370, Unknown=1, NotChecked=0, Total=420 [2018-12-08 22:13:53,906 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-08 22:14:04,245 WARN L180 SmtUtils]: Spent 9.61 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-12-08 22:14:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:14:05,375 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:14:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 22:14:05,376 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-08 22:14:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:14:05,376 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:14:05,376 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:14:05,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=153, Invalid=1036, Unknown=1, NotChecked=0, Total=1190 [2018-12-08 22:14:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:14:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-08 22:14:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 22:14:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 22:14:05,378 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-08 22:14:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:14:05,378 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-08 22:14:05,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:14:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 22:14:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 22:14:05,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:14:05,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:14:05,379 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:14:05,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:14:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-12-08 22:14:05,380 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:14:05,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:14:05,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:14:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:14:05,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:14:05,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 22:14:05,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:14:05,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:14:05,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:14:05,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:14:05,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:05,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:05,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 22:14:05,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:14:05,623 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-12-08 22:14:05,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:05,629 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-12-08 22:14:05,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-08 22:14:05,740 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-12-08 22:14:05,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:05,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:05,771 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-12-08 22:14:05,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-08 22:14:05,852 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-12-08 22:14:05,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:05,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:14:05,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:14:05,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-12-08 22:14:06,045 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-12-08 22:14:06,048 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-12-08 22:14:06,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,186 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-12-08 22:14:06,189 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-12-08 22:14:06,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:06,261 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-12-08 22:14:06,261 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-08 22:14:06,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:14:06,382 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-12-08 22:14:06,385 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-12-08 22:14:06,385 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,392 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 22:14:06,443 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:170, output treesize:84 [2018-12-08 22:14:06,504 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 22:14:06,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:06,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:06,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-08 22:14:06,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:29 [2018-12-08 22:14:06,702 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-12-08 22:14:06,705 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-12-08 22:14:06,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-12-08 22:14:06,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:14:06,783 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-12-08 22:14:06,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:14:06,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-12-08 22:14:06,830 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-12-08 22:14:06,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:14:06,837 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-12-08 22:14:06,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-12-08 22:14:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:14:06,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:14:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:14:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:14:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:14:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:14:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:14:06,887 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-08 22:14:07,674 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-12-08 22:14:08,067 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-08 22:14:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:14:09,283 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:14:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 22:14:09,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-08 22:14:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:14:09,284 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:14:09,285 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:14:09,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 22:14:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:14:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-12-08 22:14:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 22:14:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 22:14:09,286 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-08 22:14:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:14:09,286 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-08 22:14:09,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:14:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 22:14:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 22:14:09,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:14:09,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:14:09,287 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION]=== [2018-12-08 22:14:09,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:14:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-12-08 22:14:09,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:14:09,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79756a0b-b95b-4f13-b313-2a7b409da3d9/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-12-08 22:14:09,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:14:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:14:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:14:09,735 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:14:09,745 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 22:14:09,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:14:09 BoogieIcfgContainer [2018-12-08 22:14:09,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:14:09,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:14:09,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:14:09,755 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:14:09,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:38" (3/4) ... [2018-12-08 22:14:09,759 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:14:09,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:14:09,759 INFO L168 Benchmark]: Toolchain (without parser) took 91541.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.4 MB). Free memory was 939.3 MB in the beginning and 833.3 MB in the end (delta: 106.0 MB). Peak memory consumption was 352.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:14:09,760 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:14:09,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.75 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:14:09,760 INFO L168 Benchmark]: Boogie Preprocessor took 60.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -200.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:14:09,760 INFO L168 Benchmark]: RCFGBuilder took 334.17 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.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-08 22:14:09,761 INFO L168 Benchmark]: TraceAbstraction took 90909.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.1 GB in the beginning and 833.3 MB in the end (delta: 238.3 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:14:09,761 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 833.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:14:09,762 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.11 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 230.75 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -200.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.17 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.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90909.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.1 GB in the beginning and 833.3 MB in the end (delta: 238.3 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 833.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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, 90.8s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 66.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 625 SDslu, 2138 SDs, 0 SdLazy, 3306 SolverSat, 211 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 62.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.1s SatisfiabilityAnalysisTime, 22.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...