./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/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 69e4d0785323ca2fbac076cafe34fff682fc43d2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:17:24,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:17:24,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:17:24,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:17:24,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:17:24,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:17:24,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:17:24,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:17:24,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:17:24,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:17:24,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:17:24,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:17:24,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:17:24,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:17:24,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:17:24,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:17:24,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:17:24,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:17:24,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:17:24,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:17:24,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:17:24,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:17:24,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:17:24,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:17:24,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:17:24,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:17:24,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:17:24,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:17:24,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:17:24,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:17:24,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:17:24,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:17:24,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:17:24,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:17:24,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:17:24,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:17:24,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:17:24,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:17:24,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:17:24,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:17:24,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:17:24,652 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:17:24,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:17:24,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:17:24,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:17:24,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:17:24,685 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:17:24,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:17:24,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:17:24,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:17:24,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:17:24,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:17:24,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:17:24,687 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:17:24,688 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:17:24,688 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:17:24,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:17:24,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:17:24,701 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:17:24,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:17:24,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:17:24,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:17:24,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:17:24,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:17:24,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:17:24,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:17:24,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:17:24,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:17:24,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/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 -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-11-16 00:17:24,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:17:24,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:17:24,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:17:24,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:17:24,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:17:24,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-16 00:17:24,833 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/data/6be292188/b07b5cf783c04f83b1bc8f3c048b3cb1/FLAG9e4750445 [2019-11-16 00:17:25,436 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:17:25,437 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-16 00:17:25,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/data/6be292188/b07b5cf783c04f83b1bc8f3c048b3cb1/FLAG9e4750445 [2019-11-16 00:17:25,685 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/data/6be292188/b07b5cf783c04f83b1bc8f3c048b3cb1 [2019-11-16 00:17:25,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:17:25,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:17:25,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:25,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:17:25,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:17:25,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:25" (1/1) ... [2019-11-16 00:17:25,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639d099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:25, skipping insertion in model container [2019-11-16 00:17:25,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:25" (1/1) ... [2019-11-16 00:17:25,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:17:25,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:17:26,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:26,272 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:17:26,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:26,414 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:17:26,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26 WrapperNode [2019-11-16 00:17:26,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:26,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:17:26,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:17:26,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:17:26,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... [2019-11-16 00:17:26,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:17:26,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:17:26,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:17:26,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:17:26,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/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 [2019-11-16 00:17:26,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:17:26,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:17:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:17:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:17:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:17:26,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:17:26,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:17:26,564 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-16 00:17:26,565 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-16 00:17:26,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:17:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:17:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:17:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:17:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:17:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:17:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:17:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:17:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:17:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:17:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:17:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:17:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:17:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:17:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:17:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:17:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:17:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:17:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:17:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:17:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:17:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:17:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:17:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:17:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:17:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:17:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:17:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:17:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:17:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:17:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:17:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:17:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:17:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:17:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:17:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:17:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:17:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:17:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:17:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:17:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:17:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:17:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:17:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:17:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:17:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:17:26,582 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:17:26,582 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:17:26,582 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:17:26,582 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:17:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:17:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:17:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:17:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:17:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:17:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:17:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:17:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:17:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:17:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:17:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:17:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:17:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:17:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:17:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:17:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:17:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:17:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:17:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:17:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:17:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:17:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:17:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:17:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:17:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:17:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:17:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:17:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:17:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:17:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:17:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:17:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:17:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:17:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:17:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:17:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:17:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:17:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:17:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:17:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:17:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:17:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-16 00:17:26,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-16 00:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:17:27,459 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:17:27,460 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-16 00:17:27,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:27 BoogieIcfgContainer [2019-11-16 00:17:27,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:17:27,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:17:27,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:17:27,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:17:27,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:25" (1/3) ... [2019-11-16 00:17:27,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e75ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:27, skipping insertion in model container [2019-11-16 00:17:27,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:26" (2/3) ... [2019-11-16 00:17:27,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e75ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:27, skipping insertion in model container [2019-11-16 00:17:27,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:27" (3/3) ... [2019-11-16 00:17:27,470 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-11-16 00:17:27,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:17:27,490 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-11-16 00:17:27,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-11-16 00:17:27,525 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:17:27,525 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:17:27,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:17:27,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:17:27,526 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:17:27,526 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:17:27,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:17:27,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:17:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-16 00:17:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:17:27,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:27,560 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402705, now seen corresponding path program 1 times [2019-11-16 00:17:27,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174439330] [2019-11-16 00:17:27,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:27,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174439330] [2019-11-16 00:17:27,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:27,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377154820] [2019-11-16 00:17:27,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:27,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:27,897 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 6 states. [2019-11-16 00:17:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,389 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-11-16 00:17:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:17:28,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-16 00:17:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,408 INFO L225 Difference]: With dead ends: 74 [2019-11-16 00:17:28,408 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:17:28,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:17:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:17:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:17:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-11-16 00:17:28,480 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 9 [2019-11-16 00:17:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:28,481 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-11-16 00:17:28,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-11-16 00:17:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:17:28,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:28,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:28,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402704, now seen corresponding path program 1 times [2019-11-16 00:17:28,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:28,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992832879] [2019-11-16 00:17:28,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:28,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992832879] [2019-11-16 00:17:28,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:28,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:28,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588540174] [2019-11-16 00:17:28,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:28,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:28,689 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 6 states. [2019-11-16 00:17:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,051 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-11-16 00:17:29,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:29,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-16 00:17:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,053 INFO L225 Difference]: With dead ends: 68 [2019-11-16 00:17:29,053 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:17:29,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:17:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-16 00:17:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:17:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-11-16 00:17:29,064 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 9 [2019-11-16 00:17:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,064 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-11-16 00:17:29,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-11-16 00:17:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:17:29,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,065 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:29,066 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1923554319, now seen corresponding path program 1 times [2019-11-16 00:17:29,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511222145] [2019-11-16 00:17:29,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:29,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511222145] [2019-11-16 00:17:29,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:29,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:29,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274285608] [2019-11-16 00:17:29,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:29,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:29,236 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 7 states. [2019-11-16 00:17:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,595 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-11-16 00:17:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:29,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-16 00:17:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,597 INFO L225 Difference]: With dead ends: 65 [2019-11-16 00:17:29,597 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:17:29,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:17:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:17:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-16 00:17:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:17:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-11-16 00:17:29,608 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 11 [2019-11-16 00:17:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,608 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-11-16 00:17:29,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-11-16 00:17:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:17:29,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,610 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:29,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764301, now seen corresponding path program 1 times [2019-11-16 00:17:29,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927303338] [2019-11-16 00:17:29,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:29,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927303338] [2019-11-16 00:17:29,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:29,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:29,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222914074] [2019-11-16 00:17:29,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:29,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:29,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:29,714 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 6 states. [2019-11-16 00:17:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,996 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-11-16 00:17:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:29,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:17:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,997 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:17:29,998 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:17:29,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:17:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-16 00:17:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:17:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-11-16 00:17:30,006 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 13 [2019-11-16 00:17:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,006 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-11-16 00:17:30,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-11-16 00:17:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:17:30,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:30,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764300, now seen corresponding path program 1 times [2019-11-16 00:17:30,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957100830] [2019-11-16 00:17:30,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:30,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957100830] [2019-11-16 00:17:30,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:30,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031328384] [2019-11-16 00:17:30,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:30,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:30,132 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2019-11-16 00:17:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,358 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-11-16 00:17:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:30,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:17:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,360 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:17:30,360 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:17:30,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:17:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:17:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:17:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-11-16 00:17:30,370 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 13 [2019-11-16 00:17:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,370 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-11-16 00:17:30,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-11-16 00:17:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:17:30,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:30,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -13867244, now seen corresponding path program 1 times [2019-11-16 00:17:30,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769504651] [2019-11-16 00:17:30,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:30,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769504651] [2019-11-16 00:17:30,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:17:30,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034622734] [2019-11-16 00:17:30,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:17:30,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:17:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:30,589 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 12 states. [2019-11-16 00:17:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,026 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-11-16 00:17:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:17:31,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-11-16 00:17:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,028 INFO L225 Difference]: With dead ends: 62 [2019-11-16 00:17:31,028 INFO L226 Difference]: Without dead ends: 62 [2019-11-16 00:17:31,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-16 00:17:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-16 00:17:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:17:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-11-16 00:17:31,039 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 16 [2019-11-16 00:17:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,039 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-11-16 00:17:31,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:17:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-11-16 00:17:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:17:31,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:31,045 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:31,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,046 INFO L82 PathProgramCache]: Analyzing trace with hash -13867243, now seen corresponding path program 1 times [2019-11-16 00:17:31,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418605841] [2019-11-16 00:17:31,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:31,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418605841] [2019-11-16 00:17:31,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:17:31,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909752783] [2019-11-16 00:17:31,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:17:31,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:17:31,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:31,313 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 12 states. [2019-11-16 00:17:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,756 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-11-16 00:17:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:17:31,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-11-16 00:17:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,757 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:17:31,757 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:17:31,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:17:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-16 00:17:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-16 00:17:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-11-16 00:17:31,763 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 16 [2019-11-16 00:17:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,763 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-11-16 00:17:31,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:17:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-11-16 00:17:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:17:31,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,764 INFO L380 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] [2019-11-16 00:17:31,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2043476268, now seen corresponding path program 1 times [2019-11-16 00:17:31,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910624081] [2019-11-16 00:17:31,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:31,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910624081] [2019-11-16 00:17:31,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:31,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760572313] [2019-11-16 00:17:31,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:31,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:31,847 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2019-11-16 00:17:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,978 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-16 00:17:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:31,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-16 00:17:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,979 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:17:31,979 INFO L226 Difference]: Without dead ends: 57 [2019-11-16 00:17:31,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-16 00:17:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-16 00:17:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:17:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-11-16 00:17:31,984 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2019-11-16 00:17:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,985 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-11-16 00:17:31,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-11-16 00:17:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:17:31,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,986 INFO L380 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] [2019-11-16 00:17:31,986 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2043476267, now seen corresponding path program 1 times [2019-11-16 00:17:31,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795876307] [2019-11-16 00:17:31,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:32,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795876307] [2019-11-16 00:17:32,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:32,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104309361] [2019-11-16 00:17:32,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:32,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:32,072 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 5 states. [2019-11-16 00:17:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,212 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-11-16 00:17:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:32,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-16 00:17:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,213 INFO L225 Difference]: With dead ends: 53 [2019-11-16 00:17:32,214 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:17:32,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:17:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-16 00:17:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:17:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-16 00:17:32,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2019-11-16 00:17:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,218 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-16 00:17:32,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-16 00:17:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:17:32,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,220 INFO L380 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] [2019-11-16 00:17:32,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 640066169, now seen corresponding path program 1 times [2019-11-16 00:17:32,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075432489] [2019-11-16 00:17:32,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:32,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075432489] [2019-11-16 00:17:32,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-16 00:17:32,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229174309] [2019-11-16 00:17:32,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:17:32,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:17:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:32,970 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 20 states. [2019-11-16 00:17:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:34,224 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-16 00:17:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:17:34,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-16 00:17:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:34,225 INFO L225 Difference]: With dead ends: 51 [2019-11-16 00:17:34,225 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:17:34,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:17:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:17:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-16 00:17:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:17:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-16 00:17:34,230 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 30 [2019-11-16 00:17:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:34,231 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-16 00:17:34,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:17:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-16 00:17:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:17:34,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:34,232 INFO L380 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] [2019-11-16 00:17:34,233 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash 640066170, now seen corresponding path program 1 times [2019-11-16 00:17:34,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:34,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230423813] [2019-11-16 00:17:34,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:35,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230423813] [2019-11-16 00:17:35,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:35,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-16 00:17:35,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352305748] [2019-11-16 00:17:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:17:35,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:35,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:17:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:35,119 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 20 states. [2019-11-16 00:17:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:36,710 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-16 00:17:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:17:36,710 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-16 00:17:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:36,711 INFO L225 Difference]: With dead ends: 49 [2019-11-16 00:17:36,711 INFO L226 Difference]: Without dead ends: 49 [2019-11-16 00:17:36,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:17:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-16 00:17:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-16 00:17:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:17:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-16 00:17:36,716 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 30 [2019-11-16 00:17:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:36,717 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-16 00:17:36,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:17:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-16 00:17:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:17:36,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:36,718 INFO L380 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] [2019-11-16 00:17:36,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1632785210, now seen corresponding path program 1 times [2019-11-16 00:17:36,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:36,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038292038] [2019-11-16 00:17:36,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:37,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038292038] [2019-11-16 00:17:37,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:37,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-16 00:17:37,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074602444] [2019-11-16 00:17:37,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:17:37,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:17:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:17:37,261 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 21 states. [2019-11-16 00:17:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:38,255 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-11-16 00:17:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:17:38,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-16 00:17:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:38,257 INFO L225 Difference]: With dead ends: 48 [2019-11-16 00:17:38,257 INFO L226 Difference]: Without dead ends: 48 [2019-11-16 00:17:38,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:17:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-16 00:17:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-16 00:17:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:17:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-16 00:17:38,262 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 31 [2019-11-16 00:17:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:38,263 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-16 00:17:38,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:17:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-16 00:17:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:17:38,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:38,264 INFO L380 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] [2019-11-16 00:17:38,265 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1632785209, now seen corresponding path program 1 times [2019-11-16 00:17:38,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:38,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434759926] [2019-11-16 00:17:38,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:38,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:39,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434759926] [2019-11-16 00:17:39,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:39,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-16 00:17:39,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123028978] [2019-11-16 00:17:39,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:17:39,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:17:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:39,086 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 20 states. [2019-11-16 00:17:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:40,292 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-11-16 00:17:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:17:40,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-11-16 00:17:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:40,293 INFO L225 Difference]: With dead ends: 46 [2019-11-16 00:17:40,293 INFO L226 Difference]: Without dead ends: 46 [2019-11-16 00:17:40,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:17:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-16 00:17:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-16 00:17:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:17:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-11-16 00:17:40,297 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 31 [2019-11-16 00:17:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:40,298 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-11-16 00:17:40,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:17:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-11-16 00:17:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:17:40,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:40,299 INFO L380 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] [2019-11-16 00:17:40,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1799527105, now seen corresponding path program 1 times [2019-11-16 00:17:40,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:40,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608353304] [2019-11-16 00:17:40,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:40,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:40,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:40,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608353304] [2019-11-16 00:17:40,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:40,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-16 00:17:40,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775190551] [2019-11-16 00:17:40,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:17:40,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:17:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:17:40,867 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 19 states. [2019-11-16 00:17:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:41,762 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-16 00:17:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:17:41,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-11-16 00:17:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:41,763 INFO L225 Difference]: With dead ends: 45 [2019-11-16 00:17:41,763 INFO L226 Difference]: Without dead ends: 45 [2019-11-16 00:17:41,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:17:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-16 00:17:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-16 00:17:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-16 00:17:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-11-16 00:17:41,768 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 34 [2019-11-16 00:17:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:41,768 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-11-16 00:17:41,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:17:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-11-16 00:17:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:17:41,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:41,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:41,770 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1525697290, now seen corresponding path program 1 times [2019-11-16 00:17:41,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:41,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427990639] [2019-11-16 00:17:41,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:41,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:41,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:42,476 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-16 00:17:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:43,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427990639] [2019-11-16 00:17:43,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:43,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-16 00:17:43,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952474136] [2019-11-16 00:17:43,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:17:43,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:43,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:17:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:17:43,319 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 26 states. [2019-11-16 00:17:43,866 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-16 00:17:45,372 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-11-16 00:17:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:45,621 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2019-11-16 00:17:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:17:45,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-11-16 00:17:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:45,622 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:17:45,622 INFO L226 Difference]: Without dead ends: 45 [2019-11-16 00:17:45,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:17:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-16 00:17:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-16 00:17:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-16 00:17:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2019-11-16 00:17:45,627 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2019-11-16 00:17:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:45,627 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2019-11-16 00:17:45,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:17:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2019-11-16 00:17:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:17:45,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:45,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:45,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash 69905962, now seen corresponding path program 1 times [2019-11-16 00:17:45,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:45,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198507379] [2019-11-16 00:17:45,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:45,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:45,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:46,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198507379] [2019-11-16 00:17:46,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:46,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-16 00:17:46,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063177872] [2019-11-16 00:17:46,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:17:46,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:17:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:17:46,249 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 19 states. [2019-11-16 00:17:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:47,029 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-11-16 00:17:47,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:17:47,030 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-11-16 00:17:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:47,030 INFO L225 Difference]: With dead ends: 44 [2019-11-16 00:17:47,030 INFO L226 Difference]: Without dead ends: 44 [2019-11-16 00:17:47,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:17:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-16 00:17:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-16 00:17:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:17:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-11-16 00:17:47,034 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 37 [2019-11-16 00:17:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:47,034 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-11-16 00:17:47,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:17:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-11-16 00:17:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:17:47,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:47,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:47,036 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2127882365, now seen corresponding path program 1 times [2019-11-16 00:17:47,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:47,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958392443] [2019-11-16 00:17:47,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:47,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:47,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958392443] [2019-11-16 00:17:47,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:47,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-11-16 00:17:47,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682489041] [2019-11-16 00:17:47,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:17:47,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:17:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:17:47,854 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 25 states. [2019-11-16 00:17:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:49,188 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2019-11-16 00:17:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:17:49,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2019-11-16 00:17:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:49,189 INFO L225 Difference]: With dead ends: 43 [2019-11-16 00:17:49,189 INFO L226 Difference]: Without dead ends: 43 [2019-11-16 00:17:49,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:17:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-16 00:17:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-16 00:17:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:17:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-11-16 00:17:49,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 38 [2019-11-16 00:17:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:49,193 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-11-16 00:17:49,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:17:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-11-16 00:17:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:17:49,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:49,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:49,195 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:17:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1060203249, now seen corresponding path program 1 times [2019-11-16 00:17:49,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:49,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352260697] [2019-11-16 00:17:49,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:49,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:49,512 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-11-16 00:17:49,738 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-11-16 00:17:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:51,770 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-11-16 00:17:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:52,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352260697] [2019-11-16 00:17:52,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:52,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-11-16 00:17:52,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230026348] [2019-11-16 00:17:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-16 00:17:52,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:17:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:17:52,185 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 29 states. [2019-11-16 00:17:53,165 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-11-16 00:17:53,706 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:17:54,441 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-16 00:17:54,648 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-11-16 00:17:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:54,765 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-11-16 00:17:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-16 00:17:54,765 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-11-16 00:17:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:54,766 INFO L225 Difference]: With dead ends: 42 [2019-11-16 00:17:54,766 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:17:54,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:17:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:17:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:17:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:17:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:17:54,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-11-16 00:17:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:54,767 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:54,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-16 00:17:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:17:54,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:17:54,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:17:54 BoogieIcfgContainer [2019-11-16 00:17:54,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:17:54,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:17:54,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:17:54,774 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:17:54,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:27" (3/4) ... [2019-11-16 00:17:54,779 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:17:54,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:17:54,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-16 00:17:54,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-11-16 00:17:54,792 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-16 00:17:54,793 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-16 00:17:54,793 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:17:54,851 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8374b8ee-9912-4fba-b32d-462d49f1e655/bin/uautomizer/witness.graphml [2019-11-16 00:17:54,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:17:54,854 INFO L168 Benchmark]: Toolchain (without parser) took 29165.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.6 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -81.1 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:54,854 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:54,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:54,855 INFO L168 Benchmark]: Boogie Preprocessor took 72.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:54,856 INFO L168 Benchmark]: RCFGBuilder took 973.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:54,857 INFO L168 Benchmark]: TraceAbstraction took 27311.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 371.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:54,857 INFO L168 Benchmark]: Witness Printer took 77.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:54,860 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 725.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 973.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27311.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 371.4 MB. Max. memory is 11.5 GB. * Witness Printer took 77.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 95 locations, 35 error locations. Result: SAFE, OverallTime: 27.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 572 SDtfs, 731 SDslu, 2678 SDs, 0 SdLazy, 6185 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 262030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...