./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:19:45,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:19:45,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:19:45,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:19:45,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:19:45,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:19:45,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:19:45,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:19:45,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:19:45,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:19:45,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:19:45,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:19:45,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:19:45,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:19:45,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:19:45,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:19:45,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:19:45,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:19:45,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:19:45,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:19:45,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:19:45,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:19:45,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:19:45,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:19:45,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:19:45,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:19:45,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:19:45,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:19:45,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:19:45,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:19:45,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:19:45,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:19:45,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:19:45,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:19:45,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:19:45,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:19:45,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:19:45,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:19:45,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:19:45,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:19:45,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:19:45,530 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:19:45,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:19:45,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:19:45,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:19:45,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:19:45,559 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:19:45,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:19:45,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:19:45,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:19:45,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:19:45,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:19:45,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:19:45,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:19:45,561 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:19:45,561 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:19:45,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:19:45,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:19:45,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:19:45,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:19:45,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:19:45,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:19:45,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:19:45,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:19:45,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:19:45,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:19:45,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:19:45,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:19:45,564 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_5a7fe937-3a56-4708-aebf-7ea6106f5435/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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-11-15 22:19:45,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:19:45,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:19:45,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:19:45,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:19:45,623 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:19:45,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-15 22:19:45,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/data/e2aae1df5/108b0c0d0bf44a8899cf1bf29b3fa1e5/FLAGe3d9dc2ce [2019-11-15 22:19:46,216 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:19:46,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-15 22:19:46,236 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/data/e2aae1df5/108b0c0d0bf44a8899cf1bf29b3fa1e5/FLAGe3d9dc2ce [2019-11-15 22:19:46,693 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/data/e2aae1df5/108b0c0d0bf44a8899cf1bf29b3fa1e5 [2019-11-15 22:19:46,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:19:46,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:19:46,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:19:46,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:19:46,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:19:46,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:46" (1/1) ... [2019-11-15 22:19:46,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416ef513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:46, skipping insertion in model container [2019-11-15 22:19:46,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:46" (1/1) ... [2019-11-15 22:19:46,713 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:19:46,770 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:19:47,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:19:47,229 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:19:47,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:19:47,334 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:19:47,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47 WrapperNode [2019-11-15 22:19:47,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:19:47,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:19:47,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:19:47,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:19:47,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... [2019-11-15 22:19:47,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:19:47,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:19:47,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:19:47,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:19:47,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:19:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:19:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:19:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:19:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:19:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:19:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:19:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:19:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:19:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:19:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:19:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:19:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:19:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:19:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:19:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:19:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:19:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:19:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:19:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:19:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:19:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:19:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:19:47,488 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:19:47,489 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:19:47,489 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:19:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:19:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:19:47,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:19:47,492 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:19:47,492 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:19:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:19:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:19:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:19:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:19:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:19:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:19:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:19:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:19:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:19:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:19:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:19:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:19:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:19:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:19:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:19:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:19:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:19:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:19:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:19:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:19:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:19:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:19:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:19:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:19:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:19:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:19:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:19:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:19:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:19:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:19:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:19:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:19:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:19:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:19:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:19:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:19:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:19:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:19:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:19:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:19:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:19:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:19:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:19:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:19:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:19:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:19:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:19:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:19:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:19:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:19:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:19:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:19:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:19:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:19:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:19:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:19:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:19:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:19:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:19:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:19:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:19:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:19:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:19:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:19:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:19:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:19:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:19:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:19:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:19:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:19:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:19:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:19:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:19:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:19:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:19:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:19:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:19:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:19:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:19:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:19:48,428 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:19:48,428 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-15 22:19:48,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:48 BoogieIcfgContainer [2019-11-15 22:19:48,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:19:48,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:19:48,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:19:48,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:19:48,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:19:46" (1/3) ... [2019-11-15 22:19:48,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a0510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:48, skipping insertion in model container [2019-11-15 22:19:48,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:47" (2/3) ... [2019-11-15 22:19:48,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a0510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:48, skipping insertion in model container [2019-11-15 22:19:48,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:48" (3/3) ... [2019-11-15 22:19:48,438 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-11-15 22:19:48,452 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:19:48,462 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2019-11-15 22:19:48,474 INFO L249 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2019-11-15 22:19:48,499 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:19:48,499 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:19:48,500 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:19:48,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:19:48,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:19:48,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:19:48,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:19:48,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:19:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2019-11-15 22:19:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:19:48,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:48,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:48,547 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -928996123, now seen corresponding path program 1 times [2019-11-15 22:19:48,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:48,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234134651] [2019-11-15 22:19:48,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:48,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:48,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:48,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234134651] [2019-11-15 22:19:48,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:48,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:19:48,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245749198] [2019-11-15 22:19:48,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:19:48,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:48,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:19:48,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:19:48,788 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 4 states. [2019-11-15 22:19:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:49,258 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2019-11-15 22:19:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:19:49,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:19:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:49,276 INFO L225 Difference]: With dead ends: 172 [2019-11-15 22:19:49,277 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 22:19:49,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:19:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 22:19:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2019-11-15 22:19:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:19:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-11-15 22:19:49,367 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 7 [2019-11-15 22:19:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:49,368 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-11-15 22:19:49,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:19:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-11-15 22:19:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:19:49,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:49,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:49,370 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash -928996122, now seen corresponding path program 1 times [2019-11-15 22:19:49,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:49,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142483595] [2019-11-15 22:19:49,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:49,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:49,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:49,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142483595] [2019-11-15 22:19:49,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:49,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:19:49,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808651759] [2019-11-15 22:19:49,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:19:49,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:19:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:19:49,461 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 4 states. [2019-11-15 22:19:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:49,879 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-11-15 22:19:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:19:49,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:19:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:49,881 INFO L225 Difference]: With dead ends: 187 [2019-11-15 22:19:49,881 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 22:19:49,882 INFO L600 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-11-15 22:19:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 22:19:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2019-11-15 22:19:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-15 22:19:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2019-11-15 22:19:49,897 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 7 [2019-11-15 22:19:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:49,898 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2019-11-15 22:19:49,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:19:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2019-11-15 22:19:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:19:49,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:49,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:49,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash -694003629, now seen corresponding path program 1 times [2019-11-15 22:19:49,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:49,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835274163] [2019-11-15 22:19:49,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:49,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:49,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:49,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835274163] [2019-11-15 22:19:49,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:49,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:19:49,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652017983] [2019-11-15 22:19:49,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:19:49,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:19:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:49,979 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 6 states. [2019-11-15 22:19:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:50,673 INFO L93 Difference]: Finished difference Result 297 states and 327 transitions. [2019-11-15 22:19:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:50,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 22:19:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:50,676 INFO L225 Difference]: With dead ends: 297 [2019-11-15 22:19:50,676 INFO L226 Difference]: Without dead ends: 297 [2019-11-15 22:19:50,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-15 22:19:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 172. [2019-11-15 22:19:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 22:19:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-11-15 22:19:50,689 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 14 [2019-11-15 22:19:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:50,690 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-11-15 22:19:50,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:19:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-11-15 22:19:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:19:50,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:50,691 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:50,691 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash -694003628, now seen corresponding path program 1 times [2019-11-15 22:19:50,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:50,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68728657] [2019-11-15 22:19:50,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:50,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:50,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:50,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68728657] [2019-11-15 22:19:50,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:50,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:19:50,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634997471] [2019-11-15 22:19:50,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:19:50,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:19:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:50,863 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 6 states. [2019-11-15 22:19:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:51,627 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2019-11-15 22:19:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:51,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 22:19:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:51,629 INFO L225 Difference]: With dead ends: 321 [2019-11-15 22:19:51,630 INFO L226 Difference]: Without dead ends: 321 [2019-11-15 22:19:51,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-15 22:19:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 171. [2019-11-15 22:19:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 22:19:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2019-11-15 22:19:51,641 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 14 [2019-11-15 22:19:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:51,641 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2019-11-15 22:19:51,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:19:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2019-11-15 22:19:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:19:51,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:51,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:51,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 910461370, now seen corresponding path program 1 times [2019-11-15 22:19:51,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:51,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097562891] [2019-11-15 22:19:51,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:51,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:51,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097562891] [2019-11-15 22:19:51,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:51,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:19:51,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14170177] [2019-11-15 22:19:51,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:19:51,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:19:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:51,776 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 9 states. [2019-11-15 22:19:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:53,003 INFO L93 Difference]: Finished difference Result 299 states and 327 transitions. [2019-11-15 22:19:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:19:53,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-15 22:19:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:53,006 INFO L225 Difference]: With dead ends: 299 [2019-11-15 22:19:53,006 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:19:53,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:19:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:19:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 170. [2019-11-15 22:19:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 22:19:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2019-11-15 22:19:53,014 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 17 [2019-11-15 22:19:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:53,015 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2019-11-15 22:19:53,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:19:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2019-11-15 22:19:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:19:53,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:53,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:53,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 910461371, now seen corresponding path program 1 times [2019-11-15 22:19:53,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:53,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496592355] [2019-11-15 22:19:53,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:53,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:53,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:53,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496592355] [2019-11-15 22:19:53,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:53,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:19:53,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111921813] [2019-11-15 22:19:53,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:19:53,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:19:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:53,168 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 9 states. [2019-11-15 22:19:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:54,567 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2019-11-15 22:19:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:19:54,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-15 22:19:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:54,569 INFO L225 Difference]: With dead ends: 300 [2019-11-15 22:19:54,570 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:19:54,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:19:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:19:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 169. [2019-11-15 22:19:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 22:19:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2019-11-15 22:19:54,578 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 17 [2019-11-15 22:19:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:54,578 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2019-11-15 22:19:54,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:19:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2019-11-15 22:19:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:19:54,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:54,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:54,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -831607406, now seen corresponding path program 1 times [2019-11-15 22:19:54,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:54,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303602375] [2019-11-15 22:19:54,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:54,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:54,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303602375] [2019-11-15 22:19:54,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:54,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:19:54,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635849106] [2019-11-15 22:19:54,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:19:54,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:19:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:54,659 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand 6 states. [2019-11-15 22:19:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:55,071 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2019-11-15 22:19:55,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:55,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 22:19:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:55,074 INFO L225 Difference]: With dead ends: 252 [2019-11-15 22:19:55,075 INFO L226 Difference]: Without dead ends: 252 [2019-11-15 22:19:55,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-15 22:19:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 172. [2019-11-15 22:19:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 22:19:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2019-11-15 22:19:55,081 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 21 [2019-11-15 22:19:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:55,082 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2019-11-15 22:19:55,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:19:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2019-11-15 22:19:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:19:55,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:55,084 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:55,084 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532823, now seen corresponding path program 1 times [2019-11-15 22:19:55,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:55,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938820990] [2019-11-15 22:19:55,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:55,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:55,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:55,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938820990] [2019-11-15 22:19:55,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:55,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:19:55,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252001675] [2019-11-15 22:19:55,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:19:55,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:19:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:19:55,149 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 5 states. [2019-11-15 22:19:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:55,483 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2019-11-15 22:19:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:19:55,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-15 22:19:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:55,485 INFO L225 Difference]: With dead ends: 174 [2019-11-15 22:19:55,485 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 22:19:55,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 22:19:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2019-11-15 22:19:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:19:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-11-15 22:19:55,491 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 23 [2019-11-15 22:19:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:55,491 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-11-15 22:19:55,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:19:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2019-11-15 22:19:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:19:55,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:55,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:55,493 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1311532824, now seen corresponding path program 1 times [2019-11-15 22:19:55,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:55,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914510828] [2019-11-15 22:19:55,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:55,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:55,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:55,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914510828] [2019-11-15 22:19:55,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:55,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:19:55,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071747961] [2019-11-15 22:19:55,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:19:55,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:55,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:19:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:55,598 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 8 states. [2019-11-15 22:19:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:56,019 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2019-11-15 22:19:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:19:56,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-15 22:19:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:56,021 INFO L225 Difference]: With dead ends: 220 [2019-11-15 22:19:56,021 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 22:19:56,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 22:19:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2019-11-15 22:19:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 22:19:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2019-11-15 22:19:56,028 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 23 [2019-11-15 22:19:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:56,029 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2019-11-15 22:19:56,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:19:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2019-11-15 22:19:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:19:56,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:56,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:56,032 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash 556899944, now seen corresponding path program 1 times [2019-11-15 22:19:56,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:56,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221374825] [2019-11-15 22:19:56,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:56,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:56,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:56,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221374825] [2019-11-15 22:19:56,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:56,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:19:56,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410942140] [2019-11-15 22:19:56,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:19:56,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:19:56,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:19:56,127 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 7 states. [2019-11-15 22:19:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:56,646 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2019-11-15 22:19:56,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:19:56,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 22:19:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:56,648 INFO L225 Difference]: With dead ends: 271 [2019-11-15 22:19:56,648 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 22:19:56,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:19:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 22:19:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 185. [2019-11-15 22:19:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 22:19:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2019-11-15 22:19:56,654 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 26 [2019-11-15 22:19:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:56,655 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2019-11-15 22:19:56,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:19:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2019-11-15 22:19:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:19:56,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:56,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:56,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash 556899945, now seen corresponding path program 1 times [2019-11-15 22:19:56,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:56,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308649927] [2019-11-15 22:19:56,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:56,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:56,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:56,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308649927] [2019-11-15 22:19:56,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:56,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:19:56,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248831801] [2019-11-15 22:19:56,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:19:56,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:19:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:19:56,754 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 7 states. [2019-11-15 22:19:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:57,328 INFO L93 Difference]: Finished difference Result 288 states and 346 transitions. [2019-11-15 22:19:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:19:57,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 22:19:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:57,330 INFO L225 Difference]: With dead ends: 288 [2019-11-15 22:19:57,330 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 22:19:57,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:19:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 22:19:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 172. [2019-11-15 22:19:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 22:19:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2019-11-15 22:19:57,336 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 26 [2019-11-15 22:19:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:57,336 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2019-11-15 22:19:57,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:19:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2019-11-15 22:19:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:19:57,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:57,337 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:57,338 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1620647415, now seen corresponding path program 1 times [2019-11-15 22:19:57,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:57,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288841113] [2019-11-15 22:19:57,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:57,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:57,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:57,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288841113] [2019-11-15 22:19:57,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:57,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:19:57,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062860384] [2019-11-15 22:19:57,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:19:57,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:19:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:57,388 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 6 states. [2019-11-15 22:19:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:57,602 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2019-11-15 22:19:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:19:57,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-15 22:19:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:57,605 INFO L225 Difference]: With dead ends: 196 [2019-11-15 22:19:57,605 INFO L226 Difference]: Without dead ends: 196 [2019-11-15 22:19:57,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:19:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-15 22:19:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2019-11-15 22:19:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 22:19:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2019-11-15 22:19:57,610 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 29 [2019-11-15 22:19:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:57,610 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2019-11-15 22:19:57,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:19:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2019-11-15 22:19:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:19:57,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:57,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:57,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash -51857924, now seen corresponding path program 1 times [2019-11-15 22:19:57,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:57,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769624719] [2019-11-15 22:19:57,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:57,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:57,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:57,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769624719] [2019-11-15 22:19:57,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:57,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:19:57,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968721318] [2019-11-15 22:19:57,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:19:57,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:19:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:19:57,772 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand 9 states. [2019-11-15 22:19:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:58,285 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2019-11-15 22:19:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:19:58,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-11-15 22:19:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:58,287 INFO L225 Difference]: With dead ends: 263 [2019-11-15 22:19:58,287 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 22:19:58,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:19:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 22:19:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 184. [2019-11-15 22:19:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-15 22:19:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-11-15 22:19:58,293 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 33 [2019-11-15 22:19:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:58,293 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-11-15 22:19:58,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:19:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-11-15 22:19:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:19:58,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:58,295 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:19:58,295 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:58,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2064017871, now seen corresponding path program 1 times [2019-11-15 22:19:58,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:58,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023970875] [2019-11-15 22:19:58,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:58,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:58,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023970875] [2019-11-15 22:19:58,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796837539] [2019-11-15 22:19:58,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/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-11-15 22:19:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:58,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:19:58,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:58,622 INFO L375 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-11-15 22:19:58,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,637 INFO L375 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-11-15 22:19:58,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-15 22:19:58,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:58,693 INFO L375 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 21 treesize of output 20 [2019-11-15 22:19:58,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:58,715 INFO L375 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 21 treesize of output 20 [2019-11-15 22:19:58,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-15 22:19:58,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:58,810 INFO L375 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 24 treesize of output 10 [2019-11-15 22:19:58,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:58,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,829 INFO L375 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 24 treesize of output 10 [2019-11-15 22:19:58,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:58,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:19:58,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2019-11-15 22:19:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:58,846 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:19:58,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-15 22:19:58,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683084373] [2019-11-15 22:19:58,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:19:58,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:19:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:19:58,849 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 11 states. [2019-11-15 22:19:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:59,590 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2019-11-15 22:19:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:19:59,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-15 22:19:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:19:59,593 INFO L225 Difference]: With dead ends: 303 [2019-11-15 22:19:59,593 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 22:19:59,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:19:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 22:19:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2019-11-15 22:19:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 22:19:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2019-11-15 22:19:59,604 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 35 [2019-11-15 22:19:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:19:59,604 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2019-11-15 22:19:59,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:19:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2019-11-15 22:19:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:19:59,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:19:59,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:59,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:19:59,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:19:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash 669806936, now seen corresponding path program 1 times [2019-11-15 22:19:59,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:59,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721848049] [2019-11-15 22:19:59,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:59,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:59,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:59,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721848049] [2019-11-15 22:19:59,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:59,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:19:59,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739593007] [2019-11-15 22:19:59,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:19:59,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:19:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:19:59,927 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand 6 states. [2019-11-15 22:20:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:00,527 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2019-11-15 22:20:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:20:00,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-15 22:20:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:00,532 INFO L225 Difference]: With dead ends: 314 [2019-11-15 22:20:00,532 INFO L226 Difference]: Without dead ends: 314 [2019-11-15 22:20:00,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:20:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-15 22:20:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 211. [2019-11-15 22:20:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-15 22:20:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2019-11-15 22:20:00,539 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 35 [2019-11-15 22:20:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:00,540 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2019-11-15 22:20:00,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:20:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2019-11-15 22:20:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:20:00,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:00,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:00,542 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 669806937, now seen corresponding path program 1 times [2019-11-15 22:20:00,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:00,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641081372] [2019-11-15 22:20:00,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:00,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:00,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:00,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641081372] [2019-11-15 22:20:00,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:00,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:20:00,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984959771] [2019-11-15 22:20:00,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:20:00,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:00,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:20:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:20:00,655 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand 6 states. [2019-11-15 22:20:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:01,285 INFO L93 Difference]: Finished difference Result 341 states and 410 transitions. [2019-11-15 22:20:01,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:20:01,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-15 22:20:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:01,288 INFO L225 Difference]: With dead ends: 341 [2019-11-15 22:20:01,289 INFO L226 Difference]: Without dead ends: 341 [2019-11-15 22:20:01,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:20:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-15 22:20:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 210. [2019-11-15 22:20:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 22:20:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2019-11-15 22:20:01,296 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 35 [2019-11-15 22:20:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:01,296 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2019-11-15 22:20:01,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:20:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2019-11-15 22:20:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:20:01,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:01,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:01,298 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:01,299 INFO L82 PathProgramCache]: Analyzing trace with hash -283329296, now seen corresponding path program 1 times [2019-11-15 22:20:01,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:01,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173808474] [2019-11-15 22:20:01,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:01,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:01,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:01,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173808474] [2019-11-15 22:20:01,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:01,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 22:20:01,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165190640] [2019-11-15 22:20:01,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:20:01,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:20:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:20:01,525 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand 12 states. [2019-11-15 22:20:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:02,541 INFO L93 Difference]: Finished difference Result 410 states and 463 transitions. [2019-11-15 22:20:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:20:02,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-15 22:20:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:02,545 INFO L225 Difference]: With dead ends: 410 [2019-11-15 22:20:02,545 INFO L226 Difference]: Without dead ends: 410 [2019-11-15 22:20:02,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:20:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-15 22:20:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 213. [2019-11-15 22:20:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 22:20:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2019-11-15 22:20:02,556 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 37 [2019-11-15 22:20:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:02,556 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2019-11-15 22:20:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:20:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2019-11-15 22:20:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:20:02,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:02,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:02,558 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -283329295, now seen corresponding path program 1 times [2019-11-15 22:20:02,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:02,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436013193] [2019-11-15 22:20:02,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:02,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:02,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:02,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436013193] [2019-11-15 22:20:02,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:02,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 22:20:02,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920975251] [2019-11-15 22:20:02,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:20:02,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:20:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:20:02,775 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 12 states. [2019-11-15 22:20:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:04,027 INFO L93 Difference]: Finished difference Result 458 states and 512 transitions. [2019-11-15 22:20:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:20:04,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-15 22:20:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:04,030 INFO L225 Difference]: With dead ends: 458 [2019-11-15 22:20:04,030 INFO L226 Difference]: Without dead ends: 458 [2019-11-15 22:20:04,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:20:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-15 22:20:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 219. [2019-11-15 22:20:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-15 22:20:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2019-11-15 22:20:04,037 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 37 [2019-11-15 22:20:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2019-11-15 22:20:04,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:20:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2019-11-15 22:20:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:20:04,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:04,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:04,038 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash -199509631, now seen corresponding path program 1 times [2019-11-15 22:20:04,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:04,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82012342] [2019-11-15 22:20:04,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:04,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-11-15 22:20:04,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82012342] [2019-11-15 22:20:04,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:04,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:20:04,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133874728] [2019-11-15 22:20:04,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:20:04,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:20:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:20:04,140 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand 9 states. [2019-11-15 22:20:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:04,698 INFO L93 Difference]: Finished difference Result 232 states and 274 transitions. [2019-11-15 22:20:04,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:20:04,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-11-15 22:20:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:04,700 INFO L225 Difference]: With dead ends: 232 [2019-11-15 22:20:04,700 INFO L226 Difference]: Without dead ends: 232 [2019-11-15 22:20:04,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:20:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-15 22:20:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2019-11-15 22:20:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-15 22:20:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-11-15 22:20:04,707 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 38 [2019-11-15 22:20:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:04,707 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-11-15 22:20:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:20:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2019-11-15 22:20:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:20:04,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:04,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:04,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash -199509630, now seen corresponding path program 1 times [2019-11-15 22:20:04,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:04,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945751624] [2019-11-15 22:20:04,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:04,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945751624] [2019-11-15 22:20:04,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:04,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:20:04,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838801586] [2019-11-15 22:20:04,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:20:04,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:20:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:20:04,835 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand 9 states. [2019-11-15 22:20:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:05,382 INFO L93 Difference]: Finished difference Result 231 states and 273 transitions. [2019-11-15 22:20:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:20:05,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-11-15 22:20:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:05,385 INFO L225 Difference]: With dead ends: 231 [2019-11-15 22:20:05,385 INFO L226 Difference]: Without dead ends: 231 [2019-11-15 22:20:05,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:20:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-15 22:20:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2019-11-15 22:20:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 22:20:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2019-11-15 22:20:05,391 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 38 [2019-11-15 22:20:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:05,391 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2019-11-15 22:20:05,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:20:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2019-11-15 22:20:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:20:05,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:05,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:05,393 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1753341337, now seen corresponding path program 1 times [2019-11-15 22:20:05,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:05,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292040173] [2019-11-15 22:20:05,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:05,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292040173] [2019-11-15 22:20:05,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:05,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:20:05,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015413726] [2019-11-15 22:20:05,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:20:05,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:20:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:20:05,528 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand 8 states. [2019-11-15 22:20:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:06,000 INFO L93 Difference]: Finished difference Result 233 states and 273 transitions. [2019-11-15 22:20:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:20:06,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-15 22:20:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:06,002 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:20:06,002 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 22:20:06,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:20:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 22:20:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2019-11-15 22:20:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-15 22:20:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 266 transitions. [2019-11-15 22:20:06,008 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 266 transitions. Word has length 41 [2019-11-15 22:20:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:06,009 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 266 transitions. [2019-11-15 22:20:06,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:20:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 266 transitions. [2019-11-15 22:20:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:20:06,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,010 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:06,010 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1423920632, now seen corresponding path program 1 times [2019-11-15 22:20:06,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657719226] [2019-11-15 22:20:06,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:06,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657719226] [2019-11-15 22:20:06,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:06,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:06,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54594320] [2019-11-15 22:20:06,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:06,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:06,061 INFO L87 Difference]: Start difference. First operand 226 states and 266 transitions. Second operand 4 states. [2019-11-15 22:20:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:06,256 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2019-11-15 22:20:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:06,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 22:20:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:06,259 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:20:06,259 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 22:20:06,259 INFO L600 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-11-15 22:20:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 22:20:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2019-11-15 22:20:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-15 22:20:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2019-11-15 22:20:06,264 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 42 [2019-11-15 22:20:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:06,264 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2019-11-15 22:20:06,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2019-11-15 22:20:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:20:06,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,265 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-15 22:20:06,265 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1372867121, now seen corresponding path program 1 times [2019-11-15 22:20:06,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249639680] [2019-11-15 22:20:06,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:06,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249639680] [2019-11-15 22:20:06,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182271540] [2019-11-15 22:20:06,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/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-11-15 22:20:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:20:06,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:06,560 INFO L375 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-11-15 22:20:06,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:06,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,571 INFO L375 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-11-15 22:20:06,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:06,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:06,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-15 22:20:06,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:06,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:06,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,812 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 22:20:06,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:20:06,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:06,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:06,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,842 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 22:20:06,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:20:06,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:20:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:20:06,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:20:06,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 22:20:06,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:37 [2019-11-15 22:20:06,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:20:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:06,983 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:06,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2019-11-15 22:20:06,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206729834] [2019-11-15 22:20:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:20:06,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:20:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:20:06,985 INFO L87 Difference]: Start difference. First operand 227 states and 267 transitions. Second operand 18 states. [2019-11-15 22:20:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:09,072 INFO L93 Difference]: Finished difference Result 501 states and 544 transitions. [2019-11-15 22:20:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:20:09,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-15 22:20:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:09,075 INFO L225 Difference]: With dead ends: 501 [2019-11-15 22:20:09,075 INFO L226 Difference]: Without dead ends: 501 [2019-11-15 22:20:09,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:20:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-15 22:20:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 251. [2019-11-15 22:20:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 22:20:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2019-11-15 22:20:09,083 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 45 [2019-11-15 22:20:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:09,084 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2019-11-15 22:20:09,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:20:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2019-11-15 22:20:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:20:09,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:09,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:09,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:09,289 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash -762728307, now seen corresponding path program 1 times [2019-11-15 22:20:09,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:09,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483818709] [2019-11-15 22:20:09,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:09,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:09,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:09,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483818709] [2019-11-15 22:20:09,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:09,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:20:09,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035465649] [2019-11-15 22:20:09,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:20:09,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:20:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:20:09,452 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand 11 states. [2019-11-15 22:20:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:10,382 INFO L93 Difference]: Finished difference Result 435 states and 502 transitions. [2019-11-15 22:20:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:20:10,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-11-15 22:20:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:10,385 INFO L225 Difference]: With dead ends: 435 [2019-11-15 22:20:10,385 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 22:20:10,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:20:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 22:20:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 258. [2019-11-15 22:20:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 22:20:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2019-11-15 22:20:10,392 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 45 [2019-11-15 22:20:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:10,392 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2019-11-15 22:20:10,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:20:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2019-11-15 22:20:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:20:10,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:10,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:10,394 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash -762728306, now seen corresponding path program 1 times [2019-11-15 22:20:10,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:10,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492515391] [2019-11-15 22:20:10,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:10,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:10,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:10,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492515391] [2019-11-15 22:20:10,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:10,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:20:10,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378134502] [2019-11-15 22:20:10,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:20:10,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:20:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:20:10,580 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand 11 states. [2019-11-15 22:20:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:11,725 INFO L93 Difference]: Finished difference Result 438 states and 506 transitions. [2019-11-15 22:20:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:20:11,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-11-15 22:20:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:11,728 INFO L225 Difference]: With dead ends: 438 [2019-11-15 22:20:11,728 INFO L226 Difference]: Without dead ends: 438 [2019-11-15 22:20:11,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:20:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-15 22:20:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2019-11-15 22:20:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-15 22:20:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2019-11-15 22:20:11,736 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 45 [2019-11-15 22:20:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:11,736 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2019-11-15 22:20:11,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:20:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2019-11-15 22:20:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:20:11,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:11,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:11,738 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -390791237, now seen corresponding path program 1 times [2019-11-15 22:20:11,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:11,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064117477] [2019-11-15 22:20:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:11,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:11,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064117477] [2019-11-15 22:20:11,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445490342] [2019-11-15 22:20:11,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/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-11-15 22:20:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:11,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:20:11,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:20:12,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:12,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 22:20:12,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859212452] [2019-11-15 22:20:12,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:20:12,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:12,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:20:12,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:20:12,033 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 7 states. [2019-11-15 22:20:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:12,416 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2019-11-15 22:20:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:20:12,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-15 22:20:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:12,419 INFO L225 Difference]: With dead ends: 295 [2019-11-15 22:20:12,419 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 22:20:12,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:20:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 22:20:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-11-15 22:20:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-15 22:20:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2019-11-15 22:20:12,425 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 46 [2019-11-15 22:20:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:12,425 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2019-11-15 22:20:12,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:20:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2019-11-15 22:20:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:20:12,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:12,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:12,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:12,627 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2019-11-15 22:20:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1467570882, now seen corresponding path program 1 times [2019-11-15 22:20:12,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:12,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434544551] [2019-11-15 22:20:12,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:12,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:20:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:20:12,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:20:12,766 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:20:12,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:20:12 BoogieIcfgContainer [2019-11-15 22:20:12,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:20:12,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:20:12,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:20:12,864 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:20:12,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:48" (3/4) ... [2019-11-15 22:20:12,867 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:20:12,933 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5a7fe937-3a56-4708-aebf-7ea6106f5435/bin/uautomizer/witness.graphml [2019-11-15 22:20:12,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:20:12,935 INFO L168 Benchmark]: Toolchain (without parser) took 26237.98 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 339.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,935 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:12,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,936 INFO L168 Benchmark]: Boogie Preprocessor took 70.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,937 INFO L168 Benchmark]: RCFGBuilder took 1023.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,937 INFO L168 Benchmark]: TraceAbstraction took 24433.04 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.9 MB). Peak memory consumption was 292.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,938 INFO L168 Benchmark]: Witness Printer took 69.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:12,940 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 637.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1023.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24433.04 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.9 MB). Peak memory consumption was 292.8 MB. Max. memory is 11.5 GB. * Witness Printer took 69.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L992] list->next = ((void*)0) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] EXPR list->inner VAL [list={2:0}, list->inner={3:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] list->inner->next = ((void*)0) VAL [list={2:0}, list->inner={3:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] EXPR list->inner VAL [list={2:0}, list->inner={3:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] list->inner->inner = ((void*)0) VAL [list={2:0}, list->inner={3:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] EXPR list->inner VAL [list={2:0}, list->inner={3:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={2:0}, list->inner={3:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={2:0}, len=0, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1017] EXPR end->inner VAL [end={2:0}, end->inner={3:0}, len=0, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={2:0}, inner={3:0}, len=0, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={2:0}, inner={3:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={2:0}, inner={3:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1025] EXPR inner->inner VAL [end={2:0}, inner={3:0}, inner->inner={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={2:0}, inner={3:0}, inner->next={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={2:0}, inner={3:0}, inner->inner={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={2:0}, inner={0:0}, len=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={2:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 67 error locations. Result: UNSAFE, OverallTime: 24.3s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3515 SDtfs, 7072 SDslu, 11261 SDs, 0 SdLazy, 15077 SolverSat, 513 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 2387 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 873 ConstructedInterpolants, 10 QuantifiedInterpolants, 300570 SizeOfPredicates, 22 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 10/18 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! Received shutdown request...