./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95b20088216028e3d05e3cb41d4ed5c20af6a751 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:00:27,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:00:27,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:00:27,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:00:27,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:00:27,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:00:27,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:00:27,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:00:27,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:00:27,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:00:27,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:00:27,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:00:27,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:00:27,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:00:27,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:00:27,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:00:27,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:00:27,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:00:27,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:00:27,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:00:27,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:00:27,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:00:27,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:00:27,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:00:27,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:00:27,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:00:27,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:00:27,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:00:27,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:00:27,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:00:27,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:00:27,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:00:27,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:00:27,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:00:27,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:00:27,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:00:27,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:00:27,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:00:27,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:00:27,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:00:27,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:00:27,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 17:00:27,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:00:27,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:00:27,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:00:27,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:00:27,469 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:00:27,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:00:27,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:00:27,469 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:00:27,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:00:27,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:00:27,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:00:27,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:00:27,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:00:27,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:00:27,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:00:27,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:00:27,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:00:27,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:00:27,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:00:27,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:00:27,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:00:27,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:00:27,473 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_fa1b576a-4436-4530-8308-e13c80472873/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-memcleanup) ) 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 -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2019-12-07 17:00:27,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:00:27,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:00:27,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:00:27,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:00:27,603 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:00:27,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-12-07 17:00:27,649 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/data/7fcd7ee4c/f27ce4cadcbb4224ada3abc61a0a8af7/FLAG5c063d944 [2019-12-07 17:00:28,106 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:00:28,107 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/sv-benchmarks/c/forester-heap/dll-circular-1.i [2019-12-07 17:00:28,115 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/data/7fcd7ee4c/f27ce4cadcbb4224ada3abc61a0a8af7/FLAG5c063d944 [2019-12-07 17:00:28,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/data/7fcd7ee4c/f27ce4cadcbb4224ada3abc61a0a8af7 [2019-12-07 17:00:28,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:00:28,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:00:28,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:28,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:00:28,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:00:28,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762a21c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28, skipping insertion in model container [2019-12-07 17:00:28,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:00:28,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:00:28,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:28,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:00:28,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:28,421 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:00:28,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28 WrapperNode [2019-12-07 17:00:28,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:28,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:00:28,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:00:28,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:00:28,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... [2019-12-07 17:00:28,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:00:28,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:00:28,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:00:28,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:00:28,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:00:28,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:00:28,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:00:28,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:00:28,502 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:00:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:00:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:00:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:00:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:00:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:00:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:00:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:00:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:00:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:00:28,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:00:28,830 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 17:00:28,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:28 BoogieIcfgContainer [2019-12-07 17:00:28,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:00:28,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:00:28,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:00:28,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:00:28,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:00:28" (1/3) ... [2019-12-07 17:00:28,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d984ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:28, skipping insertion in model container [2019-12-07 17:00:28,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:28" (2/3) ... [2019-12-07 17:00:28,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d984ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:28, skipping insertion in model container [2019-12-07 17:00:28,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:28" (3/3) ... [2019-12-07 17:00:28,836 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2019-12-07 17:00:28,843 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:00:28,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-12-07 17:00:28,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2019-12-07 17:00:28,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:00:28,868 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:00:28,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:00:28,868 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:00:28,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:00:28,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:00:28,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:00:28,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:00:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-12-07 17:00:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:00:28,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:28,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:28,888 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629102, now seen corresponding path program 1 times [2019-12-07 17:00:28,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:28,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347935992] [2019-12-07 17:00:28,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:29,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347935992] [2019-12-07 17:00:29,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:29,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025248176] [2019-12-07 17:00:29,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:29,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:29,034 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2019-12-07 17:00:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,218 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-12-07 17:00:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:29,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 17:00:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,227 INFO L225 Difference]: With dead ends: 119 [2019-12-07 17:00:29,227 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 17:00:29,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 17:00:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2019-12-07 17:00:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:00:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-12-07 17:00:29,261 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 7 [2019-12-07 17:00:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,261 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-12-07 17:00:29,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-12-07 17:00:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:00:29,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1524629103, now seen corresponding path program 1 times [2019-12-07 17:00:29,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:29,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988128120] [2019-12-07 17:00:29,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:29,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988128120] [2019-12-07 17:00:29,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:29,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687147335] [2019-12-07 17:00:29,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:29,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:29,315 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 4 states. [2019-12-07 17:00:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,454 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-12-07 17:00:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:29,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 17:00:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,455 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:00:29,455 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:00:29,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:00:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-12-07 17:00:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 17:00:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-12-07 17:00:29,462 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-12-07 17:00:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,463 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-12-07 17:00:29,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-12-07 17:00:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:00:29,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867395, now seen corresponding path program 1 times [2019-12-07 17:00:29,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:29,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137879236] [2019-12-07 17:00:29,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:29,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137879236] [2019-12-07 17:00:29,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:29,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155603041] [2019-12-07 17:00:29,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:29,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:29,519 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2019-12-07 17:00:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,659 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-12-07 17:00:29,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:29,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 17:00:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,660 INFO L225 Difference]: With dead ends: 99 [2019-12-07 17:00:29,660 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 17:00:29,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 17:00:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2019-12-07 17:00:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 17:00:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2019-12-07 17:00:29,666 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 12 [2019-12-07 17:00:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,666 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2019-12-07 17:00:29,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2019-12-07 17:00:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:00:29,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,667 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1043867394, now seen corresponding path program 1 times [2019-12-07 17:00:29,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:29,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221180331] [2019-12-07 17:00:29,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:29,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221180331] [2019-12-07 17:00:29,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:29,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533886308] [2019-12-07 17:00:29,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:29,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:29,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:29,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:29,723 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2019-12-07 17:00:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,880 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-12-07 17:00:29,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:29,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 17:00:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,881 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:00:29,882 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:00:29,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:00:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2019-12-07 17:00:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 17:00:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-12-07 17:00:29,888 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 12 [2019-12-07 17:00:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,888 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-12-07 17:00:29,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-12-07 17:00:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:00:29,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,889 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783331, now seen corresponding path program 1 times [2019-12-07 17:00:29,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:29,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955705314] [2019-12-07 17:00:29,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:29,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955705314] [2019-12-07 17:00:29,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:29,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792315353] [2019-12-07 17:00:29,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:29,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:29,933 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2019-12-07 17:00:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:30,143 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2019-12-07 17:00:30,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:30,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 17:00:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:30,144 INFO L225 Difference]: With dead ends: 148 [2019-12-07 17:00:30,144 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 17:00:30,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-07 17:00:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 17:00:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2019-12-07 17:00:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 17:00:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-12-07 17:00:30,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-12-07 17:00:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:30,149 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-12-07 17:00:30,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-12-07 17:00:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:00:30,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:30,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:30,150 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1865783332, now seen corresponding path program 1 times [2019-12-07 17:00:30,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:30,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231253688] [2019-12-07 17:00:30,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:30,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231253688] [2019-12-07 17:00:30,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:30,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:30,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30460003] [2019-12-07 17:00:30,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:30,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:30,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:30,198 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2019-12-07 17:00:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:30,460 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-12-07 17:00:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:30,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 17:00:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:30,462 INFO L225 Difference]: With dead ends: 149 [2019-12-07 17:00:30,462 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 17:00:30,462 INFO L630 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-12-07 17:00:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 17:00:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2019-12-07 17:00:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 17:00:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-12-07 17:00:30,467 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 14 [2019-12-07 17:00:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:30,467 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-12-07 17:00:30,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-12-07 17:00:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:00:30,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:30,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:30,468 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464416, now seen corresponding path program 1 times [2019-12-07 17:00:30,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:30,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485118056] [2019-12-07 17:00:30,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:30,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485118056] [2019-12-07 17:00:30,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:30,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:00:30,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994256886] [2019-12-07 17:00:30,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:30,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:30,564 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2019-12-07 17:00:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:30,803 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2019-12-07 17:00:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:00:30,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 17:00:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:30,804 INFO L225 Difference]: With dead ends: 179 [2019-12-07 17:00:30,804 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 17:00:30,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 17:00:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 99. [2019-12-07 17:00:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:00:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-12-07 17:00:30,809 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2019-12-07 17:00:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:30,809 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-12-07 17:00:30,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-12-07 17:00:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:30,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:30,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:30,810 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108375, now seen corresponding path program 1 times [2019-12-07 17:00:30,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:30,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938984755] [2019-12-07 17:00:30,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938984755] [2019-12-07 17:00:30,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:30,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:00:30,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290437050] [2019-12-07 17:00:30,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:30,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:30,885 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 9 states. [2019-12-07 17:00:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:31,174 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-12-07 17:00:31,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:00:31,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 17:00:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:31,175 INFO L225 Difference]: With dead ends: 141 [2019-12-07 17:00:31,175 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 17:00:31,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 17:00:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2019-12-07 17:00:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:00:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-12-07 17:00:31,179 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 17 [2019-12-07 17:00:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:31,179 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-12-07 17:00:31,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-12-07 17:00:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:31,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:31,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:31,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1945108374, now seen corresponding path program 1 times [2019-12-07 17:00:31,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:31,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575927693] [2019-12-07 17:00:31,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:31,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575927693] [2019-12-07 17:00:31,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:31,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:00:31,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579570267] [2019-12-07 17:00:31,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:31,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:31,285 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 9 states. [2019-12-07 17:00:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:31,600 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2019-12-07 17:00:31,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:00:31,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 17:00:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:31,602 INFO L225 Difference]: With dead ends: 173 [2019-12-07 17:00:31,602 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 17:00:31,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 17:00:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2019-12-07 17:00:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:00:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-12-07 17:00:31,606 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 17 [2019-12-07 17:00:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:31,606 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-12-07 17:00:31,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-12-07 17:00:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:31,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:31,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:31,607 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash 748051109, now seen corresponding path program 1 times [2019-12-07 17:00:31,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:31,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073610665] [2019-12-07 17:00:31,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:31,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073610665] [2019-12-07 17:00:31,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:31,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:00:31,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726609677] [2019-12-07 17:00:31,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:00:31,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:31,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:00:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:31,686 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2019-12-07 17:00:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:32,017 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-12-07 17:00:32,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:00:32,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-07 17:00:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:32,018 INFO L225 Difference]: With dead ends: 121 [2019-12-07 17:00:32,018 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 17:00:32,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:00:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 17:00:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2019-12-07 17:00:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:00:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-12-07 17:00:32,021 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 18 [2019-12-07 17:00:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:32,021 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-12-07 17:00:32,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:00:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-12-07 17:00:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:32,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:32,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:32,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:32,022 INFO L82 PathProgramCache]: Analyzing trace with hash 748051110, now seen corresponding path program 1 times [2019-12-07 17:00:32,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:32,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395188083] [2019-12-07 17:00:32,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:32,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395188083] [2019-12-07 17:00:32,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:32,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:00:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880623490] [2019-12-07 17:00:32,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:00:32,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:00:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:00:32,118 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 11 states. [2019-12-07 17:00:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:32,613 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-12-07 17:00:32,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:00:32,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-07 17:00:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:32,614 INFO L225 Difference]: With dead ends: 116 [2019-12-07 17:00:32,614 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 17:00:32,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:00:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 17:00:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-12-07 17:00:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:00:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-12-07 17:00:32,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 18 [2019-12-07 17:00:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:32,618 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-12-07 17:00:32,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:00:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-12-07 17:00:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:00:32,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:32,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:32,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 975241550, now seen corresponding path program 1 times [2019-12-07 17:00:32,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:32,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634968652] [2019-12-07 17:00:32,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:32,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634968652] [2019-12-07 17:00:32,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:32,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:00:32,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475991000] [2019-12-07 17:00:32,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:00:32,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:00:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:32,737 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 10 states. [2019-12-07 17:00:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:33,117 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2019-12-07 17:00:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:00:33,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 17:00:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:33,120 INFO L225 Difference]: With dead ends: 149 [2019-12-07 17:00:33,120 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 17:00:33,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:00:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 17:00:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 101. [2019-12-07 17:00:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:00:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-12-07 17:00:33,125 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 20 [2019-12-07 17:00:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:33,126 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-12-07 17:00:33,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:00:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-12-07 17:00:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:00:33,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:33,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:33,128 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 975241551, now seen corresponding path program 1 times [2019-12-07 17:00:33,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:33,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913272169] [2019-12-07 17:00:33,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:33,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913272169] [2019-12-07 17:00:33,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:00:33,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625592495] [2019-12-07 17:00:33,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:33,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:33,233 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2019-12-07 17:00:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:33,633 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2019-12-07 17:00:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:00:33,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 17:00:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:33,636 INFO L225 Difference]: With dead ends: 159 [2019-12-07 17:00:33,636 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:00:33,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:00:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2019-12-07 17:00:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:00:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-12-07 17:00:33,641 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2019-12-07 17:00:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:33,642 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-12-07 17:00:33,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-12-07 17:00:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:33,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:33,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:33,644 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 167702177, now seen corresponding path program 1 times [2019-12-07 17:00:33,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:33,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443513520] [2019-12-07 17:00:33,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:33,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443513520] [2019-12-07 17:00:33,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:33,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:00:33,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205638371] [2019-12-07 17:00:33,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:00:33,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:33,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:00:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:33,695 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 8 states. [2019-12-07 17:00:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:33,913 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2019-12-07 17:00:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:00:33,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 17:00:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:33,914 INFO L225 Difference]: With dead ends: 138 [2019-12-07 17:00:33,914 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 17:00:33,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:00:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 17:00:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2019-12-07 17:00:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 17:00:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-12-07 17:00:33,917 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2019-12-07 17:00:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:33,917 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-12-07 17:00:33,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:00:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-12-07 17:00:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:33,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:33,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:33,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 167702178, now seen corresponding path program 1 times [2019-12-07 17:00:33,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:33,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199682382] [2019-12-07 17:00:33,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:34,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199682382] [2019-12-07 17:00:34,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:34,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:00:34,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885857598] [2019-12-07 17:00:34,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:00:34,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:00:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:00:34,035 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 12 states. [2019-12-07 17:00:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:34,594 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-12-07 17:00:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:00:34,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 17:00:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:34,596 INFO L225 Difference]: With dead ends: 149 [2019-12-07 17:00:34,596 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 17:00:34,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:00:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 17:00:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2019-12-07 17:00:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 17:00:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-12-07 17:00:34,602 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 21 [2019-12-07 17:00:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:34,602 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-12-07 17:00:34,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:00:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-12-07 17:00:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:00:34,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:34,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:34,604 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2046960464, now seen corresponding path program 1 times [2019-12-07 17:00:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:34,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334801028] [2019-12-07 17:00:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,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-12-07 17:00:34,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334801028] [2019-12-07 17:00:34,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:34,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:00:34,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560931707] [2019-12-07 17:00:34,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:00:34,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:34,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:00:34,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:00:34,769 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-12-07 17:00:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:35,580 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-12-07 17:00:35,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:00:35,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-07 17:00:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:35,583 INFO L225 Difference]: With dead ends: 162 [2019-12-07 17:00:35,583 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 17:00:35,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:00:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 17:00:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2019-12-07 17:00:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:00:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-12-07 17:00:35,589 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 23 [2019-12-07 17:00:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:35,590 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-12-07 17:00:35,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:00:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-12-07 17:00:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:00:35,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:35,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:35,591 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash -280035452, now seen corresponding path program 1 times [2019-12-07 17:00:35,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:35,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113628714] [2019-12-07 17:00:35,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113628714] [2019-12-07 17:00:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:00:35,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692445789] [2019-12-07 17:00:35,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:00:35,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:00:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:35,639 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 8 states. [2019-12-07 17:00:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:35,837 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2019-12-07 17:00:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:00:35,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 17:00:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:35,838 INFO L225 Difference]: With dead ends: 152 [2019-12-07 17:00:35,838 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 17:00:35,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:00:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 17:00:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2019-12-07 17:00:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 17:00:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2019-12-07 17:00:35,841 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 23 [2019-12-07 17:00:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:35,841 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2019-12-07 17:00:35,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:00:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2019-12-07 17:00:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:00:35,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:35,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:35,842 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash 968735281, now seen corresponding path program 1 times [2019-12-07 17:00:35,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:35,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597247007] [2019-12-07 17:00:35,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:35,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597247007] [2019-12-07 17:00:35,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:35,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:00:35,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317681697] [2019-12-07 17:00:35,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:35,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:35,920 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand 9 states. [2019-12-07 17:00:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:36,144 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-12-07 17:00:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:00:36,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 17:00:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:36,145 INFO L225 Difference]: With dead ends: 152 [2019-12-07 17:00:36,145 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 17:00:36,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 17:00:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2019-12-07 17:00:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 17:00:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-12-07 17:00:36,148 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 24 [2019-12-07 17:00:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:36,148 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-12-07 17:00:36,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-12-07 17:00:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:00:36,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:36,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:36,149 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1412435069, now seen corresponding path program 1 times [2019-12-07 17:00:36,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:36,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374723183] [2019-12-07 17:00:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:36,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374723183] [2019-12-07 17:00:36,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:36,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:00:36,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396099581] [2019-12-07 17:00:36,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:00:36,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:00:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:00:36,338 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 13 states. [2019-12-07 17:00:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:36,715 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-12-07 17:00:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:00:36,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-07 17:00:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:36,716 INFO L225 Difference]: With dead ends: 144 [2019-12-07 17:00:36,716 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 17:00:36,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:00:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 17:00:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2019-12-07 17:00:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 17:00:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-12-07 17:00:36,719 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 24 [2019-12-07 17:00:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:36,719 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-12-07 17:00:36,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:00:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-12-07 17:00:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:00:36,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:36,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:36,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -33931422, now seen corresponding path program 1 times [2019-12-07 17:00:36,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:36,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745048506] [2019-12-07 17:00:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745048506] [2019-12-07 17:00:36,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:36,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:00:36,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924349946] [2019-12-07 17:00:36,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:36,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:36,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:36,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:36,780 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 9 states. [2019-12-07 17:00:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:36,960 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-12-07 17:00:36,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:00:36,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 17:00:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:36,961 INFO L225 Difference]: With dead ends: 144 [2019-12-07 17:00:36,961 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 17:00:36,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:00:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 17:00:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2019-12-07 17:00:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 17:00:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-12-07 17:00:36,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 25 [2019-12-07 17:00:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:36,963 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-12-07 17:00:36,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-12-07 17:00:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:00:36,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:36,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:36,964 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 835442004, now seen corresponding path program 1 times [2019-12-07 17:00:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487581413] [2019-12-07 17:00:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:36,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487581413] [2019-12-07 17:00:36,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:36,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:36,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814595502] [2019-12-07 17:00:36,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:36,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:36,990 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 6 states. [2019-12-07 17:00:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:37,109 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2019-12-07 17:00:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:37,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:00:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:37,111 INFO L225 Difference]: With dead ends: 124 [2019-12-07 17:00:37,111 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 17:00:37,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-07 17:00:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 17:00:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-12-07 17:00:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:00:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2019-12-07 17:00:37,114 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 25 [2019-12-07 17:00:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:37,114 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2019-12-07 17:00:37,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2019-12-07 17:00:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:00:37,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:37,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:37,115 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 835442005, now seen corresponding path program 1 times [2019-12-07 17:00:37,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:37,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486061142] [2019-12-07 17:00:37,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:37,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486061142] [2019-12-07 17:00:37,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:00:37,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673661781] [2019-12-07 17:00:37,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:00:37,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:00:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:00:37,217 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 11 states. [2019-12-07 17:00:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:37,542 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-12-07 17:00:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:00:37,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-07 17:00:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:37,543 INFO L225 Difference]: With dead ends: 142 [2019-12-07 17:00:37,543 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 17:00:37,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:00:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 17:00:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-12-07 17:00:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:00:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-12-07 17:00:37,546 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 25 [2019-12-07 17:00:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:37,546 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-12-07 17:00:37,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:00:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-12-07 17:00:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:00:37,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:37,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:37,546 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1053290924, now seen corresponding path program 1 times [2019-12-07 17:00:37,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368411521] [2019-12-07 17:00:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:37,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368411521] [2019-12-07 17:00:37,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:37,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:00:37,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751508453] [2019-12-07 17:00:37,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:00:37,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:00:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:37,681 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-12-07 17:00:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:37,963 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-12-07 17:00:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:00:37,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-07 17:00:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:37,964 INFO L225 Difference]: With dead ends: 140 [2019-12-07 17:00:37,964 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 17:00:37,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:00:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 17:00:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2019-12-07 17:00:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:00:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-12-07 17:00:37,967 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 26 [2019-12-07 17:00:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:37,967 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-12-07 17:00:37,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:00:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-12-07 17:00:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:00:37,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:37,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:37,967 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1012463367, now seen corresponding path program 1 times [2019-12-07 17:00:37,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:37,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315655182] [2019-12-07 17:00:37,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:37,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315655182] [2019-12-07 17:00:37,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:37,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:37,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749268110] [2019-12-07 17:00:37,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:37,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:37,986 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 4 states. [2019-12-07 17:00:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:38,052 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2019-12-07 17:00:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:38,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:00:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:38,053 INFO L225 Difference]: With dead ends: 191 [2019-12-07 17:00:38,053 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:00:38,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:00:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2019-12-07 17:00:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 17:00:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2019-12-07 17:00:38,056 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 27 [2019-12-07 17:00:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:38,056 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2019-12-07 17:00:38,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2019-12-07 17:00:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:00:38,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:38,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:38,057 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-12-07 17:00:38,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash -682632713, now seen corresponding path program 1 times [2019-12-07 17:00:38,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:38,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036453630] [2019-12-07 17:00:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:38,091 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:00:38,091 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:00:38,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:00:38 BoogieIcfgContainer [2019-12-07 17:00:38,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:00:38,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:00:38,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:00:38,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:00:38,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:28" (3/4) ... [2019-12-07 17:00:38,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:00:38,149 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fa1b576a-4436-4530-8308-e13c80472873/bin/uautomizer/witness.graphml [2019-12-07 17:00:38,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:00:38,150 INFO L168 Benchmark]: Toolchain (without parser) took 10023.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -227.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:38,150 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:38,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:38,151 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:38,151 INFO L168 Benchmark]: RCFGBuilder took 368.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:38,151 INFO L168 Benchmark]: TraceAbstraction took 9286.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 999.5 MB in the beginning and 1.2 GB in the end (delta: -165.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:38,152 INFO L168 Benchmark]: Witness Printer took 30.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:38,153 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.98 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9286.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 999.5 MB in the beginning and 1.2 GB in the end (delta: -165.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 30.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] SLL* x = head; [L991] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1021] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 50 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1602 SDtfs, 4376 SDslu, 4798 SDs, 0 SdLazy, 7438 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 766 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 73116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...