./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/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 513955492d80533e61a72bf3905d7afaad4254d4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:52:32,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:52:32,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:52:32,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:52:32,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:52:32,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:52:32,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:52:32,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:52:32,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:52:32,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:52:32,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:52:32,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:52:32,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:52:32,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:52:32,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:52:32,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:52:32,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:52:32,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:52:32,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:52:32,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:52:32,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:52:32,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:52:32,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:52:32,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:52:32,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:52:32,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:52:32,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:52:32,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:52:32,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:52:32,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:52:32,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:52:32,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:52:32,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:52:32,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:52:32,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:52:32,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:52:32,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:52:32,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:52:32,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:52:32,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:52:32,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:52:32,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 10:52:32,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:52:32,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:52:32,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:52:32,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:52:32,498 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:52:32,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:52:32,499 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:52:32,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:52:32,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:52:32,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:52:32,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:52:32,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:52:32,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:52:32,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:52:32,501 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_b88b930d-1357-4830-a5d6-ec49cc9af051/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 -> 513955492d80533e61a72bf3905d7afaad4254d4 [2019-12-07 10:52:32,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:52:32,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:52:32,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:52:32,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:52:32,618 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:52:32,618 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-3.i [2019-12-07 10:52:32,659 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/data/e06535b9c/704a9f20c67b4cb28238d228dae2ab50/FLAG17c5960d0 [2019-12-07 10:52:33,060 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:52:33,061 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/sv-benchmarks/c/memsafety/test-0232-3.i [2019-12-07 10:52:33,070 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/data/e06535b9c/704a9f20c67b4cb28238d228dae2ab50/FLAG17c5960d0 [2019-12-07 10:52:33,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/data/e06535b9c/704a9f20c67b4cb28238d228dae2ab50 [2019-12-07 10:52:33,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:52:33,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:52:33,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:52:33,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:52:33,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:52:33,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27569ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33, skipping insertion in model container [2019-12-07 10:52:33,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:52:33,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:52:33,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:52:33,316 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:52:33,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:52:33,377 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:52:33,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33 WrapperNode [2019-12-07 10:52:33,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:52:33,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:52:33,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:52:33,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:52:33,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... [2019-12-07 10:52:33,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:52:33,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:52:33,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:52:33,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:52:33,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/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-12-07 10:52:33,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-12-07 10:52:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:52:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 10:52:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 10:52:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 10:52:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 10:52:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 10:52:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 10:52:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 10:52:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 10:52:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 10:52:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 10:52:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 10:52:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:52:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:52:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:52:33,789 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:52:33,789 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 10:52:33,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:33 BoogieIcfgContainer [2019-12-07 10:52:33,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:52:33,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:52:33,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:52:33,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:52:33,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:52:33" (1/3) ... [2019-12-07 10:52:33,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60576204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:52:33, skipping insertion in model container [2019-12-07 10:52:33,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:52:33" (2/3) ... [2019-12-07 10:52:33,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60576204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:52:33, skipping insertion in model container [2019-12-07 10:52:33,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:33" (3/3) ... [2019-12-07 10:52:33,795 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2019-12-07 10:52:33,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:52:33,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2019-12-07 10:52:33,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2019-12-07 10:52:33,830 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:52:33,830 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:52:33,830 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:52:33,830 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:52:33,830 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:52:33,830 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:52:33,830 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:52:33,830 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:52:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-12-07 10:52:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 10:52:33,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:33,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:33,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:33,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash 60745132, now seen corresponding path program 1 times [2019-12-07 10:52:33,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:33,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969974374] [2019-12-07 10:52:33,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:33,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969974374] [2019-12-07 10:52:33,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:33,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:33,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334626383] [2019-12-07 10:52:33,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:52:33,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:52:33,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:33,978 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2019-12-07 10:52:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,130 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-12-07 10:52:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:52:34,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 10:52:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,138 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:52:34,138 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:52:34,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:52:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:52:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 10:52:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:52:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-12-07 10:52:34,168 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 8 [2019-12-07 10:52:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,168 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-12-07 10:52:34,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:52:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-12-07 10:52:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:52:34,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1883232053, now seen corresponding path program 1 times [2019-12-07 10:52:34,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061690177] [2019-12-07 10:52:34,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,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-12-07 10:52:34,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061690177] [2019-12-07 10:52:34,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:52:34,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898901677] [2019-12-07 10:52:34,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:52:34,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:52:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:52:34,236 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 6 states. [2019-12-07 10:52:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,443 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-12-07 10:52:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:52:34,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 10:52:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,445 INFO L225 Difference]: With dead ends: 105 [2019-12-07 10:52:34,445 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 10:52:34,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 10:52:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-12-07 10:52:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:52:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-12-07 10:52:34,453 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 9 [2019-12-07 10:52:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,454 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-12-07 10:52:34,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:52:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-12-07 10:52:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:52:34,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,455 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1883232054, now seen corresponding path program 1 times [2019-12-07 10:52:34,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356308834] [2019-12-07 10:52:34,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:34,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356308834] [2019-12-07 10:52:34,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:52:34,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783801567] [2019-12-07 10:52:34,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:52:34,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:52:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:52:34,522 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 6 states. [2019-12-07 10:52:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,764 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2019-12-07 10:52:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:52:34,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 10:52:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,767 INFO L225 Difference]: With dead ends: 133 [2019-12-07 10:52:34,768 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 10:52:34,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 10:52:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-12-07 10:52:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:52:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-12-07 10:52:34,775 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 9 [2019-12-07 10:52:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,776 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-12-07 10:52:34,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:52:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-12-07 10:52:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:52:34,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1749348403, now seen corresponding path program 1 times [2019-12-07 10:52:34,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761730544] [2019-12-07 10:52:34,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:34,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761730544] [2019-12-07 10:52:34,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:34,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658329384] [2019-12-07 10:52:34,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:34,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:34,811 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 4 states. [2019-12-07 10:52:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:34,928 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-12-07 10:52:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:52:34,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 10:52:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:34,930 INFO L225 Difference]: With dead ends: 107 [2019-12-07 10:52:34,930 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 10:52:34,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 10:52:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 10:52:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:52:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-12-07 10:52:34,936 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 10 [2019-12-07 10:52:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:34,936 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-12-07 10:52:34,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-12-07 10:52:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:52:34,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:34,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:34,937 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1749348402, now seen corresponding path program 1 times [2019-12-07 10:52:34,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:34,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879351826] [2019-12-07 10:52:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:34,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-12-07 10:52:34,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879351826] [2019-12-07 10:52:34,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:34,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:52:34,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035823918] [2019-12-07 10:52:34,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:52:34,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:52:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:34,968 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 4 states. [2019-12-07 10:52:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,059 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2019-12-07 10:52:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:52:35,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 10:52:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,060 INFO L225 Difference]: With dead ends: 103 [2019-12-07 10:52:35,060 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 10:52:35,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:52:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 10:52:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-12-07 10:52:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:52:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2019-12-07 10:52:35,065 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 10 [2019-12-07 10:52:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,065 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2019-12-07 10:52:35,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:52:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2019-12-07 10:52:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:52:35,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:35,066 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 23530304, now seen corresponding path program 1 times [2019-12-07 10:52:35,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680789267] [2019-12-07 10:52:35,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680789267] [2019-12-07 10:52:35,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:52:35,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372763479] [2019-12-07 10:52:35,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:35,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:35,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:35,140 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 9 states. [2019-12-07 10:52:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,401 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-12-07 10:52:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:52:35,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 10:52:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,403 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:52:35,403 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 10:52:35,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:52:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 10:52:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-12-07 10:52:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 10:52:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-12-07 10:52:35,412 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 15 [2019-12-07 10:52:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,412 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-12-07 10:52:35,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-12-07 10:52:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:52:35,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:35,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash 729717586, now seen corresponding path program 1 times [2019-12-07 10:52:35,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005877789] [2019-12-07 10:52:35,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005877789] [2019-12-07 10:52:35,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:52:35,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096665554] [2019-12-07 10:52:35,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:35,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:35,497 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 8 states. [2019-12-07 10:52:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,640 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2019-12-07 10:52:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:52:35,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 10:52:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,641 INFO L225 Difference]: With dead ends: 109 [2019-12-07 10:52:35,641 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 10:52:35,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:52:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 10:52:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-12-07 10:52:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:52:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 10:52:35,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 16 [2019-12-07 10:52:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,646 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 10:52:35,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 10:52:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:52:35,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,647 INFO L410 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-12-07 10:52:35,648 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 24975038, now seen corresponding path program 1 times [2019-12-07 10:52:35,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445537809] [2019-12-07 10:52:35,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:35,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445537809] [2019-12-07 10:52:35,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:35,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:35,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558043822] [2019-12-07 10:52:35,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:35,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:35,730 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 9 states. [2019-12-07 10:52:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:35,972 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-12-07 10:52:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:35,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 10:52:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:35,973 INFO L225 Difference]: With dead ends: 123 [2019-12-07 10:52:35,973 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 10:52:35,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 10:52:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-12-07 10:52:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 10:52:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-12-07 10:52:35,977 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 24 [2019-12-07 10:52:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:35,978 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-12-07 10:52:35,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-12-07 10:52:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:52:35,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:35,979 INFO L410 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-12-07 10:52:35,979 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash 24975039, now seen corresponding path program 1 times [2019-12-07 10:52:35,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:35,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862693241] [2019-12-07 10:52:35,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:36,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862693241] [2019-12-07 10:52:36,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:36,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:36,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011852406] [2019-12-07 10:52:36,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:36,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:36,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:36,088 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 9 states. [2019-12-07 10:52:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:36,354 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-12-07 10:52:36,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:36,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 10:52:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:36,356 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:52:36,356 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 10:52:36,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 10:52:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2019-12-07 10:52:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:52:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-12-07 10:52:36,359 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 24 [2019-12-07 10:52:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:36,360 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-12-07 10:52:36,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-12-07 10:52:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:52:36,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:36,361 INFO L410 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] [2019-12-07 10:52:36,361 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1737173630, now seen corresponding path program 1 times [2019-12-07 10:52:36,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:36,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982980665] [2019-12-07 10:52:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:36,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982980665] [2019-12-07 10:52:36,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:36,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:36,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449663582] [2019-12-07 10:52:36,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:36,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:36,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:36,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:36,436 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2019-12-07 10:52:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:36,648 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-12-07 10:52:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:36,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 10:52:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:36,649 INFO L225 Difference]: With dead ends: 96 [2019-12-07 10:52:36,649 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 10:52:36,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:52:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 10:52:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-07 10:52:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 10:52:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-12-07 10:52:36,653 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 26 [2019-12-07 10:52:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:36,654 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-12-07 10:52:36,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-12-07 10:52:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:52:36,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:36,655 INFO L410 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] [2019-12-07 10:52:36,655 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1002019850, now seen corresponding path program 1 times [2019-12-07 10:52:36,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:36,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132788980] [2019-12-07 10:52:36,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132788980] [2019-12-07 10:52:36,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:36,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:36,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001381733] [2019-12-07 10:52:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:36,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:36,731 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 9 states. [2019-12-07 10:52:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:36,985 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-12-07 10:52:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:36,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-12-07 10:52:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:36,986 INFO L225 Difference]: With dead ends: 95 [2019-12-07 10:52:36,986 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 10:52:36,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 10:52:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-12-07 10:52:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 10:52:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2019-12-07 10:52:36,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 27 [2019-12-07 10:52:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:36,990 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2019-12-07 10:52:36,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2019-12-07 10:52:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:52:36,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:36,992 INFO L410 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] [2019-12-07 10:52:36,992 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1002019851, now seen corresponding path program 1 times [2019-12-07 10:52:36,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:36,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133970193] [2019-12-07 10:52:36,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:37,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133970193] [2019-12-07 10:52:37,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:37,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:52:37,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449076890] [2019-12-07 10:52:37,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:52:37,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:52:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:52:37,113 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 10 states. [2019-12-07 10:52:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:37,353 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-12-07 10:52:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:52:37,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 10:52:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:37,354 INFO L225 Difference]: With dead ends: 94 [2019-12-07 10:52:37,355 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 10:52:37,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:52:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 10:52:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-07 10:52:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 10:52:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2019-12-07 10:52:37,357 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 27 [2019-12-07 10:52:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:37,357 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2019-12-07 10:52:37,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:52:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2019-12-07 10:52:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:52:37,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:37,358 INFO L410 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] [2019-12-07 10:52:37,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 997844289, now seen corresponding path program 1 times [2019-12-07 10:52:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:37,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902350438] [2019-12-07 10:52:37,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902350438] [2019-12-07 10:52:37,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:37,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:52:37,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532434990] [2019-12-07 10:52:37,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:52:37,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:37,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:52:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:37,571 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 13 states. [2019-12-07 10:52:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:38,222 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2019-12-07 10:52:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:52:38,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 10:52:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:38,224 INFO L225 Difference]: With dead ends: 142 [2019-12-07 10:52:38,224 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 10:52:38,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:52:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 10:52:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2019-12-07 10:52:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:52:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-12-07 10:52:38,228 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 28 [2019-12-07 10:52:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:38,228 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-12-07 10:52:38,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:52:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-12-07 10:52:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:52:38,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:38,229 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:38,229 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1745778606, now seen corresponding path program 1 times [2019-12-07 10:52:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:38,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300470023] [2019-12-07 10:52:38,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:38,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300470023] [2019-12-07 10:52:38,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182483970] [2019-12-07 10:52:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:38,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 10:52:38,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:38,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:38,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:38,467 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,467 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 10:52:38,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:38,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-12-07 10:52:38,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,526 INFO L614 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-12-07 10:52:38,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,526 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-12-07 10:52:38,577 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 10:52:38,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 10:52:38,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:38,584 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:38,584 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 10:52:38,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:38,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 10:52:38,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:38,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:38,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:38,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-12-07 10:52:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:38,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:52:38,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2019-12-07 10:52:38,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706605895] [2019-12-07 10:52:38,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:52:38,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:52:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:52:38,634 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 18 states. [2019-12-07 10:52:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:39,374 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-12-07 10:52:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:52:39,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-12-07 10:52:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:39,376 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:52:39,376 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:52:39,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:52:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:52:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2019-12-07 10:52:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 10:52:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-12-07 10:52:39,383 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 29 [2019-12-07 10:52:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:39,384 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-12-07 10:52:39,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:52:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-12-07 10:52:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:52:39,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:39,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:39,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:39,587 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:39,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1745778605, now seen corresponding path program 1 times [2019-12-07 10:52:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917829989] [2019-12-07 10:52:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:39,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917829989] [2019-12-07 10:52:39,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320547725] [2019-12-07 10:52:39,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:39,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 10:52:39,825 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:39,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:39,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:39,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:39,874 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:39,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,880 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-12-07 10:52:39,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:52:39,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 10:52:39,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:39,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:39,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:52:39,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:39,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:39,971 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-12-07 10:52:40,032 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 10:52:40,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 10:52:40,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:40,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:40,050 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 10:52:40,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 10:52:40,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:40,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:40,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:40,059 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-12-07 10:52:40,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:40,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 10:52:40,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:40,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:40,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:40,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 10:52:40,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:40,129 INFO L614 ElimStorePlain]: treesize reduction 12, result has 60.0 percent of original size [2019-12-07 10:52:40,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:40,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-12-07 10:52:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:40,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:52:40,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-12-07 10:52:40,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408538167] [2019-12-07 10:52:40,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 10:52:40,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 10:52:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:52:40,155 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 21 states. [2019-12-07 10:52:40,563 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 10:52:41,029 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 10:52:41,317 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-07 10:52:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:41,554 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-12-07 10:52:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:52:41,554 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-12-07 10:52:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:41,555 INFO L225 Difference]: With dead ends: 109 [2019-12-07 10:52:41,555 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 10:52:41,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:52:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 10:52:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-12-07 10:52:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:52:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-12-07 10:52:41,559 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 29 [2019-12-07 10:52:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-12-07 10:52:41,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 10:52:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-12-07 10:52:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:52:41,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:41,560 INFO L410 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] [2019-12-07 10:52:41,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:41,761 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 868401962, now seen corresponding path program 1 times [2019-12-07 10:52:41,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:41,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876004565] [2019-12-07 10:52:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:41,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876004565] [2019-12-07 10:52:41,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:41,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:52:41,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37749839] [2019-12-07 10:52:41,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:52:41,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:52:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:41,971 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 13 states. [2019-12-07 10:52:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:43,299 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-12-07 10:52:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:52:43,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-12-07 10:52:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:43,300 INFO L225 Difference]: With dead ends: 142 [2019-12-07 10:52:43,300 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 10:52:43,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:52:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 10:52:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2019-12-07 10:52:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 10:52:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-12-07 10:52:43,305 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 29 [2019-12-07 10:52:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:43,305 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-12-07 10:52:43,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:52:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-12-07 10:52:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:52:43,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:43,306 INFO L410 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-12-07 10:52:43,306 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1150657123, now seen corresponding path program 1 times [2019-12-07 10:52:43,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:43,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364915493] [2019-12-07 10:52:43,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:43,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364915493] [2019-12-07 10:52:43,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:43,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:52:43,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48685652] [2019-12-07 10:52:43,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:52:43,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:52:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:43,506 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 13 states. [2019-12-07 10:52:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:44,130 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-12-07 10:52:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:52:44,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-07 10:52:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:44,131 INFO L225 Difference]: With dead ends: 129 [2019-12-07 10:52:44,132 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 10:52:44,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:52:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 10:52:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2019-12-07 10:52:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:52:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 10:52:44,135 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 30 [2019-12-07 10:52:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:44,135 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 10:52:44,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:52:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 10:52:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:52:44,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:44,136 INFO L410 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-12-07 10:52:44,136 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:44,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1310632525, now seen corresponding path program 1 times [2019-12-07 10:52:44,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:44,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026423564] [2019-12-07 10:52:44,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:44,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026423564] [2019-12-07 10:52:44,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:44,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:52:44,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716110837] [2019-12-07 10:52:44,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:52:44,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:52:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:52:44,228 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 11 states. [2019-12-07 10:52:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:44,461 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-12-07 10:52:44,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:44,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-07 10:52:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:44,462 INFO L225 Difference]: With dead ends: 109 [2019-12-07 10:52:44,462 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 10:52:44,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:52:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 10:52:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-12-07 10:52:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 10:52:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-12-07 10:52:44,464 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2019-12-07 10:52:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:44,464 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-12-07 10:52:44,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:52:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-12-07 10:52:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:52:44,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:44,465 INFO L410 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-12-07 10:52:44,465 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1310632526, now seen corresponding path program 1 times [2019-12-07 10:52:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:44,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752724228] [2019-12-07 10:52:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:44,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752724228] [2019-12-07 10:52:44,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:44,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:52:44,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925553690] [2019-12-07 10:52:44,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:52:44,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:52:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:52:44,502 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2019-12-07 10:52:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:44,609 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-12-07 10:52:44,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:52:44,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:52:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:44,610 INFO L225 Difference]: With dead ends: 101 [2019-12-07 10:52:44,610 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 10:52:44,610 INFO L630 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-12-07 10:52:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 10:52:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-12-07 10:52:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 10:52:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-12-07 10:52:44,612 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 31 [2019-12-07 10:52:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:44,612 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-12-07 10:52:44,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:52:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-12-07 10:52:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:52:44,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:44,613 INFO L410 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] [2019-12-07 10:52:44,613 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1974902631, now seen corresponding path program 1 times [2019-12-07 10:52:44,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:44,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304193163] [2019-12-07 10:52:44,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:44,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304193163] [2019-12-07 10:52:44,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:44,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:52:44,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59311248] [2019-12-07 10:52:44,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:44,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:44,675 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 8 states. [2019-12-07 10:52:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:44,822 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-12-07 10:52:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:44,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-07 10:52:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:44,823 INFO L225 Difference]: With dead ends: 100 [2019-12-07 10:52:44,823 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 10:52:44,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:52:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 10:52:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 10:52:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 10:52:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-12-07 10:52:44,825 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 32 [2019-12-07 10:52:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:44,825 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-12-07 10:52:44,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-12-07 10:52:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:52:44,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:44,826 INFO L410 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] [2019-12-07 10:52:44,826 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1092439501, now seen corresponding path program 1 times [2019-12-07 10:52:44,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:44,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025521478] [2019-12-07 10:52:44,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:44,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025521478] [2019-12-07 10:52:44,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:44,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:52:44,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772256521] [2019-12-07 10:52:44,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:52:44,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:52:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:52:44,887 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 8 states. [2019-12-07 10:52:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:45,085 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-12-07 10:52:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:52:45,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 10:52:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:45,086 INFO L225 Difference]: With dead ends: 99 [2019-12-07 10:52:45,086 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 10:52:45,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:52:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 10:52:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 10:52:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 10:52:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-12-07 10:52:45,088 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 33 [2019-12-07 10:52:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:45,088 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-12-07 10:52:45,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:52:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-12-07 10:52:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:52:45,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:45,089 INFO L410 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-12-07 10:52:45,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash -494113751, now seen corresponding path program 1 times [2019-12-07 10:52:45,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:45,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984279640] [2019-12-07 10:52:45,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:45,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984279640] [2019-12-07 10:52:45,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:45,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:52:45,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133934908] [2019-12-07 10:52:45,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:52:45,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:45,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:52:45,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:52:45,327 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 15 states. [2019-12-07 10:52:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:46,207 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-12-07 10:52:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:52:46,208 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-12-07 10:52:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:46,210 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:52:46,210 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:52:46,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:52:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:52:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2019-12-07 10:52:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 10:52:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-12-07 10:52:46,217 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 34 [2019-12-07 10:52:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:46,217 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-12-07 10:52:46,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:52:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-12-07 10:52:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:52:46,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:46,218 INFO L410 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] [2019-12-07 10:52:46,219 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1862342992, now seen corresponding path program 1 times [2019-12-07 10:52:46,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:46,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613334624] [2019-12-07 10:52:46,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:46,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613334624] [2019-12-07 10:52:46,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:46,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:52:46,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346592688] [2019-12-07 10:52:46,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:52:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:52:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:52:46,297 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 9 states. [2019-12-07 10:52:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:46,527 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-12-07 10:52:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:52:46,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 10:52:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:46,528 INFO L225 Difference]: With dead ends: 126 [2019-12-07 10:52:46,528 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 10:52:46,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:52:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 10:52:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-12-07 10:52:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:52:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-12-07 10:52:46,532 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 35 [2019-12-07 10:52:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:46,533 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-12-07 10:52:46,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:52:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-12-07 10:52:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:52:46,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:46,533 INFO L410 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] [2019-12-07 10:52:46,533 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1799680790, now seen corresponding path program 1 times [2019-12-07 10:52:46,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:46,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897821648] [2019-12-07 10:52:46,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:47,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897821648] [2019-12-07 10:52:47,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:47,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 10:52:47,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897472234] [2019-12-07 10:52:47,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:52:47,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:47,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:52:47,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:52:47,110 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 19 states. [2019-12-07 10:52:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:48,318 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-12-07 10:52:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:52:48,319 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2019-12-07 10:52:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:48,320 INFO L225 Difference]: With dead ends: 153 [2019-12-07 10:52:48,320 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 10:52:48,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:52:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 10:52:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2019-12-07 10:52:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 10:52:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-12-07 10:52:48,323 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 39 [2019-12-07 10:52:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:48,323 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-12-07 10:52:48,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:52:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-12-07 10:52:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:52:48,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:48,323 INFO L410 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] [2019-12-07 10:52:48,323 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1799681434, now seen corresponding path program 1 times [2019-12-07 10:52:48,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:48,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353168770] [2019-12-07 10:52:48,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353168770] [2019-12-07 10:52:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 10:52:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965876396] [2019-12-07 10:52:48,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:52:48,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:52:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:52:48,666 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 16 states. [2019-12-07 10:52:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:49,247 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-12-07 10:52:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:52:49,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-12-07 10:52:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:49,248 INFO L225 Difference]: With dead ends: 139 [2019-12-07 10:52:49,248 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 10:52:49,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:52:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 10:52:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2019-12-07 10:52:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:52:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-12-07 10:52:49,251 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 39 [2019-12-07 10:52:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:49,251 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-12-07 10:52:49,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:52:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-12-07 10:52:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:52:49,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:49,252 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:49,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1111143791, now seen corresponding path program 1 times [2019-12-07 10:52:49,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:49,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274431289] [2019-12-07 10:52:49,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:52:49,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274431289] [2019-12-07 10:52:49,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771477298] [2019-12-07 10:52:49,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:49,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 10:52:49,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:49,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:49,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:49,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:49,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:49,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 10:52:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:49,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:52:49,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-12-07 10:52:49,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490741582] [2019-12-07 10:52:49,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:52:49,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:52:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:52:49,529 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 19 states. [2019-12-07 10:52:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:50,580 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-12-07 10:52:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:52:50,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-12-07 10:52:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:50,581 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:52:50,581 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:52:50,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:52:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:52:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 10:52:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:52:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-12-07 10:52:50,583 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 42 [2019-12-07 10:52:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:50,584 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-12-07 10:52:50,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:52:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-12-07 10:52:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:52:50,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:50,584 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:50,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:50,785 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2059498329, now seen corresponding path program 1 times [2019-12-07 10:52:50,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:50,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718361566] [2019-12-07 10:52:50,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:52:51,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718361566] [2019-12-07 10:52:51,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341154248] [2019-12-07 10:52:51,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:51,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 10:52:51,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:51,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:52:51,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:52:51,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:52:51,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 10:52:51,655 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 2=[|v_#memory_$Pointer$.offset_35|]} [2019-12-07 10:52:51,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:51,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-12-07 10:52:51,682 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,702 INFO L614 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-12-07 10:52:51,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2019-12-07 10:52:51,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:52:51,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:51,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:51,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2019-12-07 10:52:52,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:52,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,077 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2019-12-07 10:52:52,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2019-12-07 10:52:52,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,188 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_6|], 22=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6|]} [2019-12-07 10:52:52,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 137 [2019-12-07 10:52:52,191 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:52,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:52:52,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 63 [2019-12-07 10:52:52,214 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:52,224 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:178, output treesize:64 [2019-12-07 10:52:52,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-12-07 10:52:52,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:52:52,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:52 [2019-12-07 10:52:52,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2019-12-07 10:52:52,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:52,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:52,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:3 [2019-12-07 10:52:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:52,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:52:52,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2019-12-07 10:52:52,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480884830] [2019-12-07 10:52:52,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 10:52:52,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:52:52,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 10:52:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 10:52:52,382 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 38 states. [2019-12-07 10:52:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:54,778 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-12-07 10:52:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 10:52:54,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2019-12-07 10:52:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:54,780 INFO L225 Difference]: With dead ends: 149 [2019-12-07 10:52:54,780 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 10:52:54,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=446, Invalid=4384, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 10:52:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 10:52:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 88. [2019-12-07 10:52:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 10:52:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-12-07 10:52:54,784 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 45 [2019-12-07 10:52:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:54,784 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-12-07 10:52:54,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 10:52:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-12-07 10:52:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 10:52:54,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:54,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:54,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:54,986 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:52:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 580061316, now seen corresponding path program 1 times [2019-12-07 10:52:54,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:52:54,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562148859] [2019-12-07 10:52:54,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:52:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:52:55,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562148859] [2019-12-07 10:52:55,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320883446] [2019-12-07 10:52:55,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:55,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-07 10:52:55,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:55,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:52:55,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:55,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:55,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:55,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 10:52:55,849 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_39|], 2=[|v_#memory_$Pointer$.base_42|]} [2019-12-07 10:52:55,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:55,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:55,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:55,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:55,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 10:52:55,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:55,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:55,895 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-12-07 10:52:55,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:55,896 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2019-12-07 10:52:56,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:52:56,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:52:56,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:56,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:56,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:56,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2019-12-07 10:52:56,118 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:56,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:56,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 10:52:56,136 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:56,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:56,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:56,150 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:10 [2019-12-07 10:53:04,049 WARN L192 SmtUtils]: Spent 991.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 10:53:04,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:53:04,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:53:04,069 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:83 [2019-12-07 10:53:04,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:53:04,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 10:53:04,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,181 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_8|], 22=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-12-07 10:53:04,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-12-07 10:53:04,185 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 65 [2019-12-07 10:53:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:53:04,217 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,247 INFO L614 ElimStorePlain]: treesize reduction 39, result has 63.9 percent of original size [2019-12-07 10:53:04,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,248 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:132, output treesize:83 [2019-12-07 10:53:04,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:53:04,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:53:04,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:83 [2019-12-07 10:53:04,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 43 [2019-12-07 10:53:04,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:53:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:53:04,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:53:04,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:53:04,520 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:5 [2019-12-07 10:53:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:53:04,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:53:04,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2019-12-07 10:53:04,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284636652] [2019-12-07 10:53:04,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 10:53:04,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:53:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 10:53:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1292, Unknown=7, NotChecked=0, Total=1406 [2019-12-07 10:53:04,534 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 38 states. [2019-12-07 10:54:04,213 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-12-07 10:54:06,431 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-12-07 10:54:08,934 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-12-07 10:54:15,602 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-12-07 10:54:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:18,112 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-12-07 10:54:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:54:18,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-12-07 10:54:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:18,113 INFO L225 Difference]: With dead ends: 88 [2019-12-07 10:54:18,113 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 10:54:18,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=370, Invalid=3510, Unknown=26, NotChecked=0, Total=3906 [2019-12-07 10:54:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 10:54:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-12-07 10:54:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 10:54:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-12-07 10:54:18,116 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 46 [2019-12-07 10:54:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:18,116 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-12-07 10:54:18,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 10:54:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-12-07 10:54:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:54:18,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:18,117 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:18,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:54:18,318 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:54:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 802031689, now seen corresponding path program 1 times [2019-12-07 10:54:18,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:54:18,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047297328] [2019-12-07 10:54:18,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:54:19,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047297328] [2019-12-07 10:54:19,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679714612] [2019-12-07 10:54:19,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:54:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:19,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 10:54:19,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:54:19,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:54:19,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:54:19,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:54:19,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,490 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 10:54:19,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:54:19,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 10:54:19,579 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_42|], 2=[|v_#memory_$Pointer$.base_47|]} [2019-12-07 10:54:19,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:54:19,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 10:54:19,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,606 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:19,633 INFO L614 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-12-07 10:54:19,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:19,634 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:59 [2019-12-07 10:54:19,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:19,734 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:54:19,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:54:19,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:19,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:19,748 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:46 [2019-12-07 10:54:20,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:54:20,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:20,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:20,360 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2019-12-07 10:54:20,575 INFO L343 Elim1Store]: treesize reduction 36, result has 79.8 percent of original size [2019-12-07 10:54:20,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 159 [2019-12-07 10:54:20,576 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,640 INFO L614 ElimStorePlain]: treesize reduction 78, result has 69.2 percent of original size [2019-12-07 10:54:20,641 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10|], 22=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-12-07 10:54:20,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2019-12-07 10:54:20,643 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:20,672 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 10:54:20,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 54 [2019-12-07 10:54:20,672 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,706 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2019-12-07 10:54:20,706 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,707 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:118 [2019-12-07 10:54:20,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:54:20,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:20,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:20,801 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:20,801 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:129, output treesize:118 [2019-12-07 10:54:20,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:20,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 56 [2019-12-07 10:54:20,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:20,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:20,892 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:20,916 INFO L614 ElimStorePlain]: treesize reduction 4, result has 90.2 percent of original size [2019-12-07 10:54:20,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:20,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:119, output treesize:37 [2019-12-07 10:54:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:54:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:54:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2019-12-07 10:54:20,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785201682] [2019-12-07 10:54:20,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 10:54:20,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:54:20,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 10:54:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 10:54:20,991 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 42 states. [2019-12-07 10:54:27,747 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-12-07 10:54:28,344 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-07 10:54:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:29,254 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-12-07 10:54:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:54:29,255 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2019-12-07 10:54:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:29,256 INFO L225 Difference]: With dead ends: 87 [2019-12-07 10:54:29,256 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 10:54:29,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=300, Invalid=3005, Unknown=1, NotChecked=0, Total=3306 [2019-12-07 10:54:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 10:54:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-12-07 10:54:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 10:54:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-12-07 10:54:29,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 47 [2019-12-07 10:54:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:29,259 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-12-07 10:54:29,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 10:54:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-12-07 10:54:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:54:29,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:29,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:29,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:54:29,461 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:54:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 229863183, now seen corresponding path program 1 times [2019-12-07 10:54:29,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:54:29,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239204945] [2019-12-07 10:54:29,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:54:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239204945] [2019-12-07 10:54:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510128241] [2019-12-07 10:54:30,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:54:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:30,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-07 10:54:30,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:54:30,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:54:30,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:54:30,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 10:54:30,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,535 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,535 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 10:54:30,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:54:30,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 10:54:30,628 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_45|], 2=[|v_#memory_$Pointer$.base_52|]} [2019-12-07 10:54:30,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:54:30,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 10:54:30,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,656 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:30,684 INFO L614 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-12-07 10:54:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:54:30,685 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:59 [2019-12-07 10:54:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:54:30,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:54:30,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:54:30,912 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:54:30,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:54:30,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:46 [2019-12-07 10:54:44,719 WARN L192 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 10:55:09,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:09,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 85 [2019-12-07 10:55:09,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:09,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:09,452 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 25=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_12|]} [2019-12-07 10:55:09,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 93 [2019-12-07 10:55:09,455 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:09,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:09,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:09,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:09,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:09,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:55:09,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:09,483 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 10:55:09,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 46 [2019-12-07 10:55:09,484 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:09,504 INFO L614 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2019-12-07 10:55:09,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:55:09,505 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:154, output treesize:81 [2019-12-07 10:55:09,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:09,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 86 [2019-12-07 10:55:09,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:09,933 INFO L614 ElimStorePlain]: treesize reduction 32, result has 81.2 percent of original size [2019-12-07 10:55:09,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:55:09,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:117, output treesize:138 [2019-12-07 10:55:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,018 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 18=[|#memory_$Pointer$.base|]} [2019-12-07 10:55:10,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2019-12-07 10:55:10,022 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:10,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-12-07 10:55:10,025 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:10,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:10,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:55:10,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:55:10,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:10,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 111 treesize of output 75 [2019-12-07 10:55:10,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:55:10,097 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:55:10,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:55:10,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:55:10,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:55:10,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:55:10,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 77 [2019-12-07 10:55:10,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:55:10,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,120 INFO L534 ElimStorePlain]: Start of recursive call 5: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 10:55:10,194 INFO L614 ElimStorePlain]: treesize reduction 23, result has 81.5 percent of original size [2019-12-07 10:55:10,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:55:10,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:55:10,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 10:55:10,196 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:267, output treesize:72 [2019-12-07 10:55:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:10,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:55:10,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2019-12-07 10:55:10,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307118096] [2019-12-07 10:55:10,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 10:55:10,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 10:55:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2169, Unknown=24, NotChecked=0, Total=2352 [2019-12-07 10:55:10,410 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 49 states. [2019-12-07 10:56:38,895 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-12-07 10:56:45,364 WARN L192 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-12-07 10:56:51,248 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-07 10:56:58,048 WARN L192 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 10:57:19,570 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-07 10:57:23,838 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-12-07 10:57:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:25,624 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2019-12-07 10:57:25,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:57:25,625 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 51 [2019-12-07 10:57:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:25,626 INFO L225 Difference]: With dead ends: 144 [2019-12-07 10:57:25,626 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 10:57:25,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 106.3s TimeCoverageRelationStatistics Valid=471, Invalid=5634, Unknown=57, NotChecked=0, Total=6162 [2019-12-07 10:57:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 10:57:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 103. [2019-12-07 10:57:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:57:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-12-07 10:57:25,629 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 51 [2019-12-07 10:57:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:25,630 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-12-07 10:57:25,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 10:57:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-12-07 10:57:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:57:25,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:25,630 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:25,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:57:25,831 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:57:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:25,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1464175830, now seen corresponding path program 1 times [2019-12-07 10:57:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721320350] [2019-12-07 10:57:25,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:57:25,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721320350] [2019-12-07 10:57:25,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948390236] [2019-12-07 10:57:25,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:57:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:25,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 10:57:25,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:57:26,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:57:26,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:26,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 10:57:26,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:26,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:57:26,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:26,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-12-07 10:57:26,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 10:57:26,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:26,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 10:57:26,055 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:26,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,058 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2019-12-07 10:57:26,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 10:57:26,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:26,069 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 10:57:26,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:57:26,069 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-12-07 10:57:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:57:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:57:26,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2019-12-07 10:57:26,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379016385] [2019-12-07 10:57:26,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:57:26,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:57:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:57:26,089 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 16 states. [2019-12-07 10:57:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:26,823 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-12-07 10:57:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:57:26,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-12-07 10:57:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:26,825 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:57:26,825 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 10:57:26,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:57:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 10:57:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2019-12-07 10:57:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:57:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2019-12-07 10:57:26,830 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 52 [2019-12-07 10:57:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:26,830 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2019-12-07 10:57:26,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:57:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2019-12-07 10:57:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:57:26,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:26,831 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:57:27,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:57:27,033 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:57:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 313118704, now seen corresponding path program 1 times [2019-12-07 10:57:27,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:57:27,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251311274] [2019-12-07 10:57:27,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:57:27,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251311274] [2019-12-07 10:57:27,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208013229] [2019-12-07 10:57:27,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:57:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:27,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 10:57:27,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:57:27,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:57:27,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:27,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:27,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:27,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 10:57:30,442 WARN L192 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-07 10:57:35,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:35,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:57:35,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:35,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2019-12-07 10:57:35,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:35,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:24 [2019-12-07 10:57:35,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 10:57:35,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:35,788 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,788 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2019-12-07 10:57:35,867 INFO L343 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2019-12-07 10:57:35,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 34 [2019-12-07 10:57:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:57:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:57:35,868 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:57:35,879 INFO L614 ElimStorePlain]: treesize reduction 12, result has 69.2 percent of original size [2019-12-07 10:57:35,879 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:57:35,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:27 [2019-12-07 10:57:35,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 10:57:35,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:57:35,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:57:35,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2019-12-07 10:57:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:57:35,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:57:35,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2019-12-07 10:57:35,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543975457] [2019-12-07 10:57:35,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 10:57:35,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:57:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 10:57:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1074, Unknown=7, NotChecked=0, Total=1190 [2019-12-07 10:57:35,934 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 35 states. [2019-12-07 10:57:56,019 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 10:57:58,981 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-12-07 10:58:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:16,817 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-12-07 10:58:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:58:16,817 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2019-12-07 10:58:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:16,818 INFO L225 Difference]: With dead ends: 131 [2019-12-07 10:58:16,818 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 10:58:16,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=322, Invalid=2855, Unknown=15, NotChecked=0, Total=3192 [2019-12-07 10:58:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 10:58:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2019-12-07 10:58:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:58:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-12-07 10:58:16,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 56 [2019-12-07 10:58:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:16,821 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-12-07 10:58:16,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 10:58:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-12-07 10:58:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:58:16,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:16,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:58:17,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:17,022 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:58:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 313119348, now seen corresponding path program 1 times [2019-12-07 10:58:17,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:17,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566789713] [2019-12-07 10:58:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:18,186 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 10:58:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:58:18,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566789713] [2019-12-07 10:58:18,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343618748] [2019-12-07 10:58:18,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:18,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 103 conjunts are in the unsatisfiable core [2019-12-07 10:58:18,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:58:18,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:18,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:58:18,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:18,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-12-07 10:58:18,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:58:18,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:18,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,702 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-12-07 10:58:18,752 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_47|], 2=[|v_#memory_$Pointer$.base_63|]} [2019-12-07 10:58:18,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:58:18,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:18,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:18,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 43 [2019-12-07 10:58:18,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:18,777 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,804 INFO L614 ElimStorePlain]: treesize reduction 16, result has 74.2 percent of original size [2019-12-07 10:58:18,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:18,804 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:59 [2019-12-07 10:58:25,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:58:25,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:25,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 10:58:25,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:25,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:25,982 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_11|], 22=[|v_#memory_$Pointer$.base_BEFORE_CALL_16|]} [2019-12-07 10:58:25,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2019-12-07 10:58:25,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:26,008 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 10:58:26,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 50 [2019-12-07 10:58:26,008 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,028 INFO L614 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-12-07 10:58:26,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,029 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:93 [2019-12-07 10:58:26,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:26,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 102 [2019-12-07 10:58:26,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,604 INFO L614 ElimStorePlain]: treesize reduction 40, result has 80.0 percent of original size [2019-12-07 10:58:26,604 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,605 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:135, output treesize:160 [2019-12-07 10:58:26,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:26,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2019-12-07 10:58:26,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2019-12-07 10:58:26,704 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:26,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:26,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:58:26,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:309, output treesize:267 [2019-12-07 10:58:27,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:27,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 112 [2019-12-07 10:58:27,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:27,035 INFO L614 ElimStorePlain]: treesize reduction 82, result has 51.2 percent of original size [2019-12-07 10:58:27,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:27,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:86 [2019-12-07 10:58:27,139 INFO L343 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2019-12-07 10:58:27,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 74 [2019-12-07 10:58:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:27,141 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:27,167 INFO L614 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-12-07 10:58:27,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:27,167 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:66 [2019-12-07 10:58:27,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:27,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 36 [2019-12-07 10:58:27,260 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:27,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:27,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:27,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:16 [2019-12-07 10:58:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:27,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:58:27,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 56 [2019-12-07 10:58:27,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160061759] [2019-12-07 10:58:27,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 10:58:27,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 10:58:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3007, Unknown=3, NotChecked=0, Total=3192 [2019-12-07 10:58:27,352 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 57 states. [2019-12-07 10:58:36,466 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 81 [2019-12-07 10:58:36,897 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-12-07 10:58:37,952 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-12-07 10:58:38,286 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-12-07 10:58:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:41,070 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2019-12-07 10:58:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 10:58:41,071 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-12-07 10:58:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:41,073 INFO L225 Difference]: With dead ends: 142 [2019-12-07 10:58:41,073 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 10:58:41,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=593, Invalid=8146, Unknown=3, NotChecked=0, Total=8742 [2019-12-07 10:58:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 10:58:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2019-12-07 10:58:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:58:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 10:58:41,081 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 56 [2019-12-07 10:58:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:41,081 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 10:58:41,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 10:58:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 10:58:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:58:41,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:41,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:58:41,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:41,283 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:58:41,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash 313119349, now seen corresponding path program 1 times [2019-12-07 10:58:41,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:41,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329611496] [2019-12-07 10:58:41,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:58:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329611496] [2019-12-07 10:58:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867478746] [2019-12-07 10:58:42,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:42,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-07 10:58:42,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:58:42,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:58:42,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:42,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:42,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:42,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 10:58:42,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:58:42,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:42,530 INFO L614 ElimStorePlain]: treesize reduction 3, result has 92.5 percent of original size [2019-12-07 10:58:42,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:42,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2019-12-07 10:58:42,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:58:42,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:58:42,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:42,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:42,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:42,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:44 [2019-12-07 10:58:44,556 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 10:58:44,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:44,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 10:58:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:44,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:44,576 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:44,607 INFO L614 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2019-12-07 10:58:44,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:44,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:44,608 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:95 [2019-12-07 10:58:44,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:45,481 WARN L192 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 10:58:45,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:45,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:45,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:45,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:58:45,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:45,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:58:45,562 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:45,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:45,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2019-12-07 10:58:45,576 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:45,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:45,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:45,585 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:190, output treesize:43 [2019-12-07 10:58:46,133 INFO L343 Elim1Store]: treesize reduction 44, result has 40.5 percent of original size [2019-12-07 10:58:46,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 75 [2019-12-07 10:58:46,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:46,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:58:46,136 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:46,177 INFO L614 ElimStorePlain]: treesize reduction 31, result has 69.0 percent of original size [2019-12-07 10:58:46,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:46,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2019-12-07 10:58:46,182 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:46,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:46,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:58:46,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:46 [2019-12-07 10:58:46,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-12-07 10:58:46,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:46,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:46,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 10:58:46,263 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:58:46,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:58:46,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:58:46,270 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2019-12-07 10:58:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:46,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:58:46,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2019-12-07 10:58:46,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589797516] [2019-12-07 10:58:46,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 10:58:46,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 10:58:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1527, Unknown=1, NotChecked=0, Total=1640 [2019-12-07 10:58:46,326 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 41 states. [2019-12-07 10:58:47,470 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 10:58:49,960 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-12-07 10:58:54,472 WARN L192 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-07 10:58:58,235 WARN L192 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-12-07 10:59:02,970 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-12-07 10:59:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:04,281 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-12-07 10:59:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:59:04,282 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 56 [2019-12-07 10:59:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:04,283 INFO L225 Difference]: With dead ends: 135 [2019-12-07 10:59:04,283 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 10:59:04,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=390, Invalid=4028, Unknown=4, NotChecked=0, Total=4422 [2019-12-07 10:59:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 10:59:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2019-12-07 10:59:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:59:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-12-07 10:59:04,287 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 56 [2019-12-07 10:59:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:04,287 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-12-07 10:59:04,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 10:59:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-12-07 10:59:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:59:04,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:04,287 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:04,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:04,488 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:59:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash 736835367, now seen corresponding path program 1 times [2019-12-07 10:59:04,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:04,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017431257] [2019-12-07 10:59:04,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:59:04,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017431257] [2019-12-07 10:59:04,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651604749] [2019-12-07 10:59:04,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:05,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 10:59:05,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:59:05,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:59:05,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:05,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:05,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:05,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 10:59:07,869 WARN L192 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 10:59:07,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:59:07,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:07,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:07,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:07,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:67 [2019-12-07 10:59:09,289 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 10:59:09,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:59:09,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2019-12-07 10:59:09,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,323 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:30 [2019-12-07 10:59:09,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-12-07 10:59:09,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2019-12-07 10:59:09,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2019-12-07 10:59:09,519 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,529 INFO L614 ElimStorePlain]: treesize reduction 11, result has 66.7 percent of original size [2019-12-07 10:59:09,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:09,529 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-12-07 10:59:09,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 10:59:09,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:09,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:09,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-12-07 10:59:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:59:09,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:59:09,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2019-12-07 10:59:09,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121405638] [2019-12-07 10:59:09,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 10:59:09,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 10:59:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1128, Unknown=3, NotChecked=0, Total=1260 [2019-12-07 10:59:09,584 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 36 states. [2019-12-07 10:59:18,489 WARN L192 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-07 10:59:29,104 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 10:59:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:31,025 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2019-12-07 10:59:31,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 10:59:31,025 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 60 [2019-12-07 10:59:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:31,026 INFO L225 Difference]: With dead ends: 134 [2019-12-07 10:59:31,026 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 10:59:31,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=355, Invalid=2943, Unknown=8, NotChecked=0, Total=3306 [2019-12-07 10:59:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 10:59:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-12-07 10:59:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 10:59:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2019-12-07 10:59:31,029 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 60 [2019-12-07 10:59:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:31,029 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2019-12-07 10:59:31,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 10:59:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2019-12-07 10:59:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:59:31,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:31,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:31,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:31,230 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:59:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash 736821434, now seen corresponding path program 1 times [2019-12-07 10:59:31,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:31,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444020924] [2019-12-07 10:59:31,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 10:59:31,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444020924] [2019-12-07 10:59:31,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:31,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:59:31,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617860831] [2019-12-07 10:59:31,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:59:31,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:31,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:59:31,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:59:31,279 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 7 states. [2019-12-07 10:59:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:31,420 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 10:59:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:59:31,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-07 10:59:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:31,421 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:59:31,421 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:59:31,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:59:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:59:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2019-12-07 10:59:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 10:59:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-12-07 10:59:31,424 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 60 [2019-12-07 10:59:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:31,424 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-12-07 10:59:31,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:59:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-12-07 10:59:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:59:31,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:31,424 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:31,425 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:59:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash 736821435, now seen corresponding path program 1 times [2019-12-07 10:59:31,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:31,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159574143] [2019-12-07 10:59:31,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:59:32,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159574143] [2019-12-07 10:59:32,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462672773] [2019-12-07 10:59:32,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:32,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-07 10:59:32,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:59:32,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:59:32,576 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:32,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:32,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:32,579 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 10:59:32,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:59:32,742 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:32,757 INFO L614 ElimStorePlain]: treesize reduction 3, result has 92.5 percent of original size [2019-12-07 10:59:32,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:32,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2019-12-07 10:59:32,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:59:32,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 10:59:32,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:32,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:32,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:32,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:50 [2019-12-07 10:59:34,863 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 10:59:34,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:34,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 50 [2019-12-07 10:59:34,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:34,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:34,881 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:34,912 INFO L614 ElimStorePlain]: treesize reduction 16, result has 83.3 percent of original size [2019-12-07 10:59:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:34,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:34,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:101 [2019-12-07 10:59:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:36,786 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 10:59:36,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:36,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:36,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:36,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:59:36,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:36,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:59:36,888 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:36,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:36,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 48 [2019-12-07 10:59:36,906 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:36,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:36,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:36,917 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:202, output treesize:53 [2019-12-07 10:59:37,247 INFO L343 Elim1Store]: treesize reduction 44, result has 40.5 percent of original size [2019-12-07 10:59:37,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 81 [2019-12-07 10:59:37,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:37,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:59:37,248 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:37,271 INFO L614 ElimStorePlain]: treesize reduction 27, result has 71.3 percent of original size [2019-12-07 10:59:37,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:37,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2019-12-07 10:59:37,276 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:37,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:37,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:59:37,284 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:52 [2019-12-07 10:59:37,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-07 10:59:37,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:37,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:37,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-12-07 10:59:37,520 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:37,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:37,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:37,524 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:9 [2019-12-07 10:59:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:59:37,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:59:37,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2019-12-07 10:59:37,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196514535] [2019-12-07 10:59:37,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 10:59:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 10:59:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1686, Unknown=1, NotChecked=0, Total=1806 [2019-12-07 10:59:37,585 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 43 states. [2019-12-07 10:59:39,383 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-07 10:59:42,082 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-07 10:59:46,734 WARN L192 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-12-07 10:59:50,216 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 10:59:53,474 WARN L192 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-12-07 10:59:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:54,851 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-12-07 10:59:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 10:59:54,851 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 60 [2019-12-07 10:59:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:54,852 INFO L225 Difference]: With dead ends: 131 [2019-12-07 10:59:54,852 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 10:59:54,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=413, Invalid=4413, Unknown=4, NotChecked=0, Total=4830 [2019-12-07 10:59:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 10:59:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2019-12-07 10:59:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 10:59:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2019-12-07 10:59:54,854 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 60 [2019-12-07 10:59:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:54,854 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-12-07 10:59:54,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 10:59:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2019-12-07 10:59:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 10:59:54,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:54,855 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:55,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:55,056 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 10:59:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1367060032, now seen corresponding path program 1 times [2019-12-07 10:59:55,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:55,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003792778] [2019-12-07 10:59:55,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:59:55,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003792778] [2019-12-07 10:59:55,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499887869] [2019-12-07 10:59:55,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:59:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:55,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 10:59:55,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:59:55,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:59:55,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:55,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:55,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:55,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 10:59:55,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-12-07 10:59:55,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:59:55,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:59:55,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:59:55,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-12-07 10:59:58,241 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 11:00:01,977 WARN L192 SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 11:00:03,982 WARN L860 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int) (|append_#t~ite8.base| Int) (|append_#t~mem3.base| Int)) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 |append_#t~mem3.base|) 4 |append_#t~ite8.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))) |c_#memory_$Pointer$.base|) (<= |append_#t~mem3.base| (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) (< append_~item~0.base |c_#StackHeapBarrier|))) is different from true [2019-12-07 11:00:03,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:00:03,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-12-07 11:00:03,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:03,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:03,998 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:03,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:27 [2019-12-07 11:00:04,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 11:00:04,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:04,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:04,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:04,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:38 [2019-12-07 11:00:04,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:04,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-12-07 11:00:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:04,265 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:00:04,302 INFO L614 ElimStorePlain]: treesize reduction 54, result has 50.5 percent of original size [2019-12-07 11:00:04,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:00:04,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:56 [2019-12-07 11:00:04,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:00:04,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-12-07 11:00:04,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:04,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:04,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:04,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:5 [2019-12-07 11:00:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-12-07 11:00:04,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:04,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-12-07 11:00:04,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072419548] [2019-12-07 11:00:04,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 11:00:04,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 11:00:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1061, Unknown=7, NotChecked=66, Total=1260 [2019-12-07 11:00:04,414 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 36 states. [2019-12-07 11:00:12,217 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 11:00:19,245 WARN L192 SmtUtils]: Spent 966.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 11:00:27,431 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 11:00:35,284 WARN L192 SmtUtils]: Spent 943.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 11:00:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:42,657 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-12-07 11:00:42,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:00:42,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 61 [2019-12-07 11:00:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:42,658 INFO L225 Difference]: With dead ends: 129 [2019-12-07 11:00:42,658 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 11:00:42,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=364, Invalid=3040, Unknown=22, NotChecked=114, Total=3540 [2019-12-07 11:00:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 11:00:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2019-12-07 11:00:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 11:00:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2019-12-07 11:00:42,660 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 61 [2019-12-07 11:00:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:42,660 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2019-12-07 11:00:42,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 11:00:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2019-12-07 11:00:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:00:42,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:42,661 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:42,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:42,862 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:00:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1366628033, now seen corresponding path program 1 times [2019-12-07 11:00:42,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:42,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983116892] [2019-12-07 11:00:42,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:00:44,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983116892] [2019-12-07 11:00:44,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260358539] [2019-12-07 11:00:44,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 103 conjunts are in the unsatisfiable core [2019-12-07 11:00:44,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:44,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:00:44,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:00:44,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:00:44,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,365 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 11:00:44,413 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_82|], 2=[|v_#memory_$Pointer$.offset_65|]} [2019-12-07 11:00:44,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:00:44,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-12-07 11:00:44,438 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,458 INFO L614 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-12-07 11:00:44,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2019-12-07 11:00:44,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 11:00:44,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:00:44,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:00:44,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2019-12-07 11:00:52,912 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 11:01:03,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:03,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 11:01:03,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:03,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:03,364 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_BEFORE_CALL_20|], 11=[|v_#memory_$Pointer$.offset_BEFORE_CALL_19|]} [2019-12-07 11:01:03,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 37 [2019-12-07 11:01:03,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:03,399 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.9 percent of original size [2019-12-07 11:01:03,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:01:03,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2019-12-07 11:01:03,402 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:03,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:03,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:01:03,415 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:131, output treesize:65 [2019-12-07 11:01:03,784 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_86|], 18=[|v_#memory_$Pointer$.offset_69|]} [2019-12-07 11:01:03,807 INFO L343 Elim1Store]: treesize reduction 44, result has 40.5 percent of original size [2019-12-07 11:01:03,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 81 [2019-12-07 11:01:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:03,808 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:01:03,838 INFO L614 ElimStorePlain]: treesize reduction 23, result has 77.5 percent of original size [2019-12-07 11:01:03,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:03,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 53 [2019-12-07 11:01:03,843 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:03,864 INFO L614 ElimStorePlain]: treesize reduction 7, result has 90.1 percent of original size [2019-12-07 11:01:03,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:01:03,865 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:64 [2019-12-07 11:01:04,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-12-07 11:01:04,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:04,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:04,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:01:04,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:45 [2019-12-07 11:01:04,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:04,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2019-12-07 11:01:04,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:01:04,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:01:04,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:01:04,215 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2019-12-07 11:01:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:04,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:01:04,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 50 [2019-12-07 11:01:04,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438237947] [2019-12-07 11:01:04,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 11:01:04,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 11:01:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2403, Unknown=11, NotChecked=0, Total=2550 [2019-12-07 11:01:04,240 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 51 states. [2019-12-07 11:01:45,727 WARN L192 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-07 11:01:54,599 WARN L192 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-12-07 11:02:04,907 WARN L192 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-12-07 11:02:23,312 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-12-07 11:02:30,255 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-12-07 11:02:39,676 WARN L192 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-12-07 11:02:48,080 WARN L192 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-12-07 11:02:58,037 WARN L192 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2019-12-07 11:03:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:02,585 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-12-07 11:03:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:03:02,585 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 61 [2019-12-07 11:03:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:02,586 INFO L225 Difference]: With dead ends: 159 [2019-12-07 11:03:02,586 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 11:03:02,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 88.8s TimeCoverageRelationStatistics Valid=539, Invalid=6738, Unknown=33, NotChecked=0, Total=7310 [2019-12-07 11:03:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 11:03:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. [2019-12-07 11:03:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 11:03:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2019-12-07 11:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 61 [2019-12-07 11:03:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:02,589 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2019-12-07 11:03:02,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 11:03:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2019-12-07 11:03:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:03:02,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:02,589 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:02,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:02,791 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:03:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -570811831, now seen corresponding path program 1 times [2019-12-07 11:03:02,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:02,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975338853] [2019-12-07 11:03:02,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 11:03:02,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975338853] [2019-12-07 11:03:02,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:02,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:03:02,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910391064] [2019-12-07 11:03:02,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:03:02,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:02,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:03:02,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:02,840 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 7 states. [2019-12-07 11:03:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:02,988 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-12-07 11:03:02,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:03:02,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 11:03:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:02,989 INFO L225 Difference]: With dead ends: 131 [2019-12-07 11:03:02,989 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 11:03:02,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:03:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 11:03:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-12-07 11:03:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 11:03:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2019-12-07 11:03:02,991 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 62 [2019-12-07 11:03:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:02,991 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2019-12-07 11:03:02,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:03:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2019-12-07 11:03:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:03:02,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:02,991 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:02,992 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:03:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:02,992 INFO L82 PathProgramCache]: Analyzing trace with hash -584203814, now seen corresponding path program 1 times [2019-12-07 11:03:02,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:02,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798303905] [2019-12-07 11:03:02,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:03:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798303905] [2019-12-07 11:03:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130458203] [2019-12-07 11:03:04,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:04,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-07 11:03:04,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:04,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:03:04,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:03:04,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:03:04,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 11:03:04,632 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_70|], 2=[|v_#memory_$Pointer$.base_88|]} [2019-12-07 11:03:04,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:03:04,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 11:03:04,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:04,658 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,685 INFO L614 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2019-12-07 11:03:04,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,685 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:56 [2019-12-07 11:03:04,749 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:03:04,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 11:03:04,756 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,764 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,764 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:102, output treesize:46 [2019-12-07 11:03:04,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:03:04,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:03:04,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2019-12-07 11:03:04,843 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:04,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:04,847 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:10 [2019-12-07 11:03:13,065 WARN L192 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 11:03:23,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 11:03:23,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:23,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,261 INFO L430 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30|], 11=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_30|]} [2019-12-07 11:03:23,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-12-07 11:03:23,266 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:23,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2019-12-07 11:03:23,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:23,296 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:23,326 INFO L614 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-12-07 11:03:23,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:23,327 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:133, output treesize:67 [2019-12-07 11:03:23,775 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_74|], 18=[|v_#memory_$Pointer$.base_92|]} [2019-12-07 11:03:23,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:03:23,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2019-12-07 11:03:23,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:23,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:23,806 INFO L343 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2019-12-07 11:03:23,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 67 [2019-12-07 11:03:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:23,807 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:03:23,832 INFO L614 ElimStorePlain]: treesize reduction 8, result has 89.2 percent of original size [2019-12-07 11:03:23,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:03:23,832 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:66 [2019-12-07 11:03:24,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 11:03:24,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:24,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:24,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:03:24,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:55 [2019-12-07 11:03:24,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:24,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 23 [2019-12-07 11:03:24,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:03:24,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:03:24,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:03:24,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:5 [2019-12-07 11:03:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:24,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:03:24,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 51 [2019-12-07 11:03:24,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717367810] [2019-12-07 11:03:24,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 11:03:24,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 11:03:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2501, Unknown=11, NotChecked=0, Total=2652 [2019-12-07 11:03:24,241 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand 52 states. [2019-12-07 11:04:05,827 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-07 11:04:13,818 WARN L192 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-07 11:04:21,077 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-12-07 11:04:39,477 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-12-07 11:04:46,248 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-12-07 11:04:55,580 WARN L192 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-12-07 11:05:03,907 WARN L192 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-07 11:05:05,777 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-12-07 11:05:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:08,625 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-12-07 11:05:08,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:05:08,625 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 62 [2019-12-07 11:05:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:08,626 INFO L225 Difference]: With dead ends: 157 [2019-12-07 11:05:08,626 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 11:05:08,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=564, Invalid=7061, Unknown=31, NotChecked=0, Total=7656 [2019-12-07 11:05:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 11:05:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 129. [2019-12-07 11:05:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 11:05:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2019-12-07 11:05:08,629 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 62 [2019-12-07 11:05:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:08,629 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2019-12-07 11:05:08,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 11:05:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2019-12-07 11:05:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:05:08,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:08,630 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:08,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:08,831 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr40ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-12-07 11:05:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash -930448925, now seen corresponding path program 1 times [2019-12-07 11:05:08,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:08,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264191546] [2019-12-07 11:05:08,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:05:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:05:08,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:05:08,881 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:05:08,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:05:08 BoogieIcfgContainer [2019-12-07 11:05:08,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:05:08,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:05:08,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:05:08,913 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:05:08,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:52:33" (3/4) ... [2019-12-07 11:05:08,914 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:05:08,949 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b88b930d-1357-4830-a5d6-ec49cc9af051/bin/uautomizer/witness.graphml [2019-12-07 11:05:08,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:05:08,950 INFO L168 Benchmark]: Toolchain (without parser) took 755870.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 940.8 MB in the beginning and 929.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,950 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:05:08,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,951 INFO L168 Benchmark]: Boogie Preprocessor took 38.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,951 INFO L168 Benchmark]: RCFGBuilder took 373.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,951 INFO L168 Benchmark]: TraceAbstraction took 755121.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 135.5 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,951 INFO L168 Benchmark]: Witness Printer took 36.63 ms. Allocated memory is still 1.2 GB. Free memory was 932.2 MB in the beginning and 929.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:05:08,952 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 755121.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 135.5 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. * Witness Printer took 36.63 ms. Allocated memory is still 1.2 GB. Free memory was 932.2 MB in the beginning and 929.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 541]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L528] struct item *list = ((void *)0); VAL [list={13:0}] [L530] CALL append(&list) VAL [plist={13:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L520] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L521] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L524] *plist = item VAL [item={1:0}, malloc(sizeof *item)={7:0}, malloc(sizeof *item)={1:0}, plist={13:0}, plist={13:0}] [L530] RET append(&list) VAL [list={13:0}] [L531] COND TRUE __VERIFIER_nondet_int() [L530] CALL append(&list) VAL [plist={13:0}] [L519] struct item *item = malloc(sizeof *item); VAL [item={10:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L520] EXPR \read(**plist) VAL [\read(**plist)={1:0}, item={10:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L520] item->next = *plist VAL [\read(**plist)={1:0}, item={10:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L521] EXPR item->next VAL [item={10:0}, item->next={1:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={10:0}, item->next={1:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L522] EXPR item->next VAL [item={10:0}, item->next={1:0}, item->next={1:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L522] EXPR item->next->data VAL [item={10:0}, item->next={1:0}, item->next={1:0}, item->next->data={7:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L521-L523] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={10:0}, item->next={1:0}, item->next={1:0}, item->next->data={7:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L521-L523] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={10:0}, item->next={1:0}, item->next={1:0}, item->next->data={7:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L524] *plist = item VAL [item={10:0}, malloc(sizeof *item)={10:0}, plist={13:0}, plist={13:0}] [L530] RET append(&list) VAL [list={13:0}] [L531] COND FALSE !(__VERIFIER_nondet_int()) [L532] \read(*list) VAL [\read(*list)={10:0}, list={13:0}] [L532] COND TRUE \read(*list) [L533] EXPR \read(*list) VAL [\read(*list)={10:0}, list={13:0}] [L533] EXPR list->next VAL [\read(*list)={10:0}, list={13:0}, list->next={1:0}] [L533] struct item *next = list->next; [L534] EXPR \read(*list) VAL [\read(*list)={10:0}, list={13:0}, next={1:0}] [L534] EXPR list->data VAL [\read(*list)={10:0}, list={13:0}, list->data={7:0}, next={1:0}] [L534] free(list->data) VAL [\read(*list)={10:0}, list={13:0}, list->data={7:0}, next={1:0}] [L534] free(list->data) VAL [\read(*list)={10:0}, list={13:0}, list->data={7:0}, next={1:0}] [L534] free(list->data) [L535] EXPR \read(*list) VAL [\read(*list)={10:0}, list={13:0}, next={1:0}] [L535] free(list) VAL [\read(*list)={10:0}, list={13:0}, next={1:0}] [L535] free(list) VAL [\read(*list)={10:0}, list={13:0}, next={1:0}] [L535] free(list) [L536] list = next VAL [list={13:0}, next={1:0}] [L538] \read(*list) VAL [\read(*list)={1:0}, list={13:0}, next={1:0}] [L538] COND TRUE \read(*list) [L539] EXPR \read(*list) VAL [\read(*list)={1:0}, list={13:0}, next={1:0}] [L539] EXPR list->next VAL [\read(*list)={1:0}, list={13:0}, list->next={0:0}, next={1:0}] [L539] struct item *next = list->next; [L540] COND TRUE !next VAL [list={13:0}, next={1:0}, next={0:0}] [L541] EXPR \read(*list) VAL [\read(*list)={1:0}, list={13:0}, next={0:0}, next={1:0}] [L541] EXPR list->data VAL [\read(*list)={1:0}, list={13:0}, list->data={7:0}, next={0:0}, next={1:0}] [L541] free(list->data) VAL [\read(*list)={1:0}, list={13:0}, list->data={7:0}, next={1:0}, next={0:0}] [L541] free(list->data) VAL [\read(*list)={1:0}, list={13:0}, list->data={7:0}, next={1:0}, next={0:0}] [L541] free(list->data) VAL [\read(*list)={1:0}, list={13:0}, list->data={7:0}, next={0:0}, next={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 129 locations, 55 error locations. Result: UNSAFE, OverallTime: 755.0s, OverallIterations: 42, TraceHistogramMax: 2, AutomataDifference: 604.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2178 SDtfs, 5896 SDslu, 15433 SDs, 0 SdLazy, 27466 SolverSat, 1233 SolverUnsat, 205 SolverUnknown, 0 SolverNotchecked, 303.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1949 GetRequests, 682 SyntacticMatches, 25 SemanticMatches, 1242 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14875 ImplicationChecksByTransitivity, 436.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=40, 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, 41 MinimizatonAttempts, 525 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 144.8s InterpolantComputationTime, 2377 NumberOfCodeBlocks, 2377 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2257 ConstructedInterpolants, 149 QuantifiedInterpolants, 2755275 SizeOfPredicates, 406 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 1146 ConjunctsInUnsatCore, 57 InterpolantComputations, 25 PerfectInterpolantSequences, 191/448 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 incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...