./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4d5612c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9c54128245d3ab9ad313da188c7be33f66027c6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-f4d5612 [2019-11-28 12:53:00,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:53:00,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:53:00,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:53:00,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:53:00,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:53:00,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:53:00,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:53:00,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:53:00,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:53:00,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:53:00,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:53:00,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:53:00,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:53:00,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:53:00,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:53:00,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:53:00,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:53:00,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:53:00,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:53:00,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:53:00,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:53:00,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:53:00,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:53:00,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:53:00,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:53:00,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:53:00,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:53:00,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:53:00,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:53:00,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:53:00,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:53:00,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:53:00,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:53:00,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:53:00,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:53:00,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:53:00,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:53:00,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:53:00,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:53:00,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:53:00,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 12:53:00,483 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:53:00,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:53:00,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:53:00,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:53:00,487 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:53:00,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:53:00,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:53:00,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 12:53:00,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:53:00,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:53:00,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:53:00,489 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 12:53:00,490 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 12:53:00,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:53:00,491 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 12:53:00,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:53:00,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:53:00,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:53:00,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:53:00,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:53:00,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:53:00,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:53:00,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:53:00,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:53:00,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 12:53:00,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 12:53:00,495 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-28 12:53:00,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:53:00,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:53:00,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:53:00,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:53:00,821 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:53:00,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-28 12:53:00,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce370b67d/871e56ac23164ec6919e2cd647b910e2/FLAG7c1038361 [2019-11-28 12:53:01,372 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:53:01,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-28 12:53:01,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce370b67d/871e56ac23164ec6919e2cd647b910e2/FLAG7c1038361 [2019-11-28 12:53:01,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce370b67d/871e56ac23164ec6919e2cd647b910e2 [2019-11-28 12:53:01,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:53:01,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 12:53:01,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:53:01,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:53:01,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:53:01,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:53:01" (1/1) ... [2019-11-28 12:53:01,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573c7019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:01, skipping insertion in model container [2019-11-28 12:53:01,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:53:01" (1/1) ... [2019-11-28 12:53:01,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:53:01,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:53:02,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:53:02,246 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 12:53:02,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:53:02,359 INFO L208 MainTranslator]: Completed translation [2019-11-28 12:53:02,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02 WrapperNode [2019-11-28 12:53:02,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:53:02,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 12:53:02,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 12:53:02,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 12:53:02,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... [2019-11-28 12:53:02,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 12:53:02,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 12:53:02,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 12:53:02,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 12:53:02,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:53:02,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 12:53:02,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 12:53:02,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 12:53:02,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 12:53:02,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 12:53:02,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 12:53:02,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 12:53:02,477 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-28 12:53:02,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 12:53:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 12:53:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 12:53:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 12:53:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 12:53:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 12:53:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 12:53:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 12:53:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 12:53:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 12:53:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 12:53:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 12:53:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 12:53:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 12:53:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 12:53:02,485 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 12:53:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 12:53:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 12:53:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 12:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 12:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 12:53:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 12:53:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 12:53:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 12:53:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 12:53:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 12:53:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 12:53:02,816 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-28 12:53:03,123 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 12:53:03,123 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 12:53:03,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:53:03 BoogieIcfgContainer [2019-11-28 12:53:03,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 12:53:03,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 12:53:03,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 12:53:03,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 12:53:03,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:53:01" (1/3) ... [2019-11-28 12:53:03,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eafc2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:53:03, skipping insertion in model container [2019-11-28 12:53:03,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:53:02" (2/3) ... [2019-11-28 12:53:03,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eafc2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:53:03, skipping insertion in model container [2019-11-28 12:53:03,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:53:03" (3/3) ... [2019-11-28 12:53:03,135 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-28 12:53:03,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 12:53:03,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-28 12:53:03,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-28 12:53:03,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 12:53:03,207 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 12:53:03,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 12:53:03,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 12:53:03,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 12:53:03,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 12:53:03,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 12:53:03,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 12:53:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2019-11-28 12:53:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 12:53:03,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:03,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:03,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash 783594837, now seen corresponding path program 1 times [2019-11-28 12:53:03,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:03,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078249194] [2019-11-28 12:53:03,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:03,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078249194] [2019-11-28 12:53:03,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 12:53:03,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153227948] [2019-11-28 12:53:03,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 12:53:03,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 12:53:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:53:03,480 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-11-28 12:53:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:03,720 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-28 12:53:03,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 12:53:03,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 12:53:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:03,736 INFO L225 Difference]: With dead ends: 81 [2019-11-28 12:53:03,736 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 12:53:03,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:53:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 12:53:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 12:53:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 12:53:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-11-28 12:53:03,804 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 10 [2019-11-28 12:53:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:03,805 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-11-28 12:53:03,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 12:53:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-11-28 12:53:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 12:53:03,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:03,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:03,807 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399476, now seen corresponding path program 1 times [2019-11-28 12:53:03,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:03,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468082611] [2019-11-28 12:53:03,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468082611] [2019-11-28 12:53:03,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 12:53:03,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257537746] [2019-11-28 12:53:03,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:53:03,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:53:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:53:03,961 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2019-11-28 12:53:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:04,205 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-28 12:53:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:53:04,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 12:53:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:04,207 INFO L225 Difference]: With dead ends: 95 [2019-11-28 12:53:04,207 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 12:53:04,208 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-11-28 12:53:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 12:53:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2019-11-28 12:53:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 12:53:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-11-28 12:53:04,220 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 11 [2019-11-28 12:53:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:04,220 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-11-28 12:53:04,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:53:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-11-28 12:53:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 12:53:04,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:04,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:04,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399475, now seen corresponding path program 1 times [2019-11-28 12:53:04,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:04,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507193614] [2019-11-28 12:53:04,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:04,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507193614] [2019-11-28 12:53:04,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:04,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 12:53:04,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170104660] [2019-11-28 12:53:04,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:53:04,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:53:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:53:04,353 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states. [2019-11-28 12:53:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:04,625 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-11-28 12:53:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:53:04,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 12:53:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:04,627 INFO L225 Difference]: With dead ends: 103 [2019-11-28 12:53:04,627 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 12:53:04,628 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-11-28 12:53:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 12:53:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2019-11-28 12:53:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 12:53:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-28 12:53:04,654 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 11 [2019-11-28 12:53:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:04,655 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-28 12:53:04,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:53:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-28 12:53:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 12:53:04,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:04,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:04,658 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -203522987, now seen corresponding path program 1 times [2019-11-28 12:53:04,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:04,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894279349] [2019-11-28 12:53:04,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:04,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894279349] [2019-11-28 12:53:04,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:04,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 12:53:04,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098793146] [2019-11-28 12:53:04,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:53:04,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:04,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:53:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:53:04,821 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2019-11-28 12:53:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:05,140 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2019-11-28 12:53:05,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:53:05,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 12:53:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:05,143 INFO L225 Difference]: With dead ends: 136 [2019-11-28 12:53:05,143 INFO L226 Difference]: Without dead ends: 136 [2019-11-28 12:53:05,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:53:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-28 12:53:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 94. [2019-11-28 12:53:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 12:53:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-11-28 12:53:05,154 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 18 [2019-11-28 12:53:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-11-28 12:53:05,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:53:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-11-28 12:53:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 12:53:05,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:05,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:05,156 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2045615242, now seen corresponding path program 1 times [2019-11-28 12:53:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142324674] [2019-11-28 12:53:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:05,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142324674] [2019-11-28 12:53:05,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:05,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 12:53:05,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814285731] [2019-11-28 12:53:05,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:53:05,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:53:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:53:05,221 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2019-11-28 12:53:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:05,407 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-28 12:53:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:53:05,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 12:53:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:05,409 INFO L225 Difference]: With dead ends: 101 [2019-11-28 12:53:05,409 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 12:53:05,409 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-11-28 12:53:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 12:53:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-11-28 12:53:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 12:53:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-28 12:53:05,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 19 [2019-11-28 12:53:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:05,418 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-28 12:53:05,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:53:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-28 12:53:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 12:53:05,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:05,419 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-11-28 12:53:05,420 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1010482820, now seen corresponding path program 1 times [2019-11-28 12:53:05,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:05,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456347000] [2019-11-28 12:53:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:05,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456347000] [2019-11-28 12:53:05,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:05,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 12:53:05,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025260226] [2019-11-28 12:53:05,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:53:05,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:53:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:53:05,513 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2019-11-28 12:53:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:05,723 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-11-28 12:53:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:53:05,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 12:53:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:05,725 INFO L225 Difference]: With dead ends: 105 [2019-11-28 12:53:05,725 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 12:53:05,725 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-11-28 12:53:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 12:53:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-28 12:53:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 12:53:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-28 12:53:05,733 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 20 [2019-11-28 12:53:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-28 12:53:05,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:53:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-28 12:53:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:53:05,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:05,735 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-11-28 12:53:05,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1258779451, now seen corresponding path program 1 times [2019-11-28 12:53:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:05,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799278921] [2019-11-28 12:53:05,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:05,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799278921] [2019-11-28 12:53:05,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:05,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 12:53:05,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450398062] [2019-11-28 12:53:05,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:53:05,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:53:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:53:05,845 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 6 states. [2019-11-28 12:53:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:06,038 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-11-28 12:53:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:53:06,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 12:53:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:06,041 INFO L225 Difference]: With dead ends: 111 [2019-11-28 12:53:06,041 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 12:53:06,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:53:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 12:53:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-28 12:53:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 12:53:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-28 12:53:06,049 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 21 [2019-11-28 12:53:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:06,049 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-28 12:53:06,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:53:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-28 12:53:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:53:06,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:06,050 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-11-28 12:53:06,050 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1260196507, now seen corresponding path program 1 times [2019-11-28 12:53:06,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:06,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341589466] [2019-11-28 12:53:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:06,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341589466] [2019-11-28 12:53:06,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:06,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 12:53:06,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160026914] [2019-11-28 12:53:06,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:53:06,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:53:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:53:06,125 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 8 states. [2019-11-28 12:53:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:06,469 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-28 12:53:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:53:06,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 12:53:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:06,470 INFO L225 Difference]: With dead ends: 115 [2019-11-28 12:53:06,470 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 12:53:06,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:53:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 12:53:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-11-28 12:53:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 12:53:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-11-28 12:53:06,475 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 21 [2019-11-28 12:53:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:06,475 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-11-28 12:53:06,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:53:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-11-28 12:53:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:53:06,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:06,477 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:06,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -404712455, now seen corresponding path program 1 times [2019-11-28 12:53:06,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:06,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521161934] [2019-11-28 12:53:06,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:06,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521161934] [2019-11-28 12:53:06,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:06,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:53:06,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049150891] [2019-11-28 12:53:06,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:53:06,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:53:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:53:06,537 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2019-11-28 12:53:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:06,792 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2019-11-28 12:53:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:53:06,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 12:53:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:06,794 INFO L225 Difference]: With dead ends: 98 [2019-11-28 12:53:06,794 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 12:53:06,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:53:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 12:53:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2019-11-28 12:53:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 12:53:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-11-28 12:53:06,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 21 [2019-11-28 12:53:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:06,800 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-28 12:53:06,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:53:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-11-28 12:53:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 12:53:06,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:06,801 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:06,801 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash -404712454, now seen corresponding path program 1 times [2019-11-28 12:53:06,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:06,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662476095] [2019-11-28 12:53:06,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:53:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:53:06,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662476095] [2019-11-28 12:53:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:53:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 12:53:06,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868751934] [2019-11-28 12:53:06,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:53:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 12:53:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:53:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:53:06,881 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 7 states. [2019-11-28 12:53:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:53:07,189 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-28 12:53:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:53:07,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 12:53:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:53:07,195 INFO L225 Difference]: With dead ends: 89 [2019-11-28 12:53:07,196 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 12:53:07,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:53:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 12:53:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-28 12:53:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 12:53:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-28 12:53:07,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2019-11-28 12:53:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:53:07,200 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-28 12:53:07,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:53:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-28 12:53:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 12:53:07,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:53:07,201 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:53:07,202 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 12:53:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:53:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1029325368, now seen corresponding path program 1 times [2019-11-28 12:53:07,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 12:53:07,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163721128] [2019-11-28 12:53:07,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 12:53:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 12:53:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 12:53:07,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 12:53:07,268 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 12:53:07,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:53:07 BoogieIcfgContainer [2019-11-28 12:53:07,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 12:53:07,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 12:53:07,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 12:53:07,329 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 12:53:07,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:53:03" (3/4) ... [2019-11-28 12:53:07,332 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 12:53:07,419 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 12:53:07,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 12:53:07,424 INFO L168 Benchmark]: Toolchain (without parser) took 5688.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -68.8 MB). Peak memory consumption was 149.3 MB. Max. memory is 11.5 GB. [2019-11-28 12:53:07,425 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:53:07,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 12:53:07,428 INFO L168 Benchmark]: Boogie Preprocessor took 61.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-28 12:53:07,429 INFO L168 Benchmark]: RCFGBuilder took 702.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-28 12:53:07,430 INFO L168 Benchmark]: TraceAbstraction took 4202.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-11-28 12:53:07,430 INFO L168 Benchmark]: Witness Printer took 90.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:53:07,437 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 702.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4202.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. * Witness Printer took 90.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 562]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] int flag = 1; [L522] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L523] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] List t; [L525] List p = a; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L528] p->h = 2 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L529] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L536] p->n = t VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L537] EXPR p->n VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L537] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L540] p = a [L541] flag = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L542] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=2, t={-2:0}] [L542] COND TRUE p->h != 3 [L543] COND TRUE \read(flag) [L544] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L545] EXPR p->h VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=2, t={-2:0}] [L545] COND TRUE p->h != 1 [L562] __VERIFIER_error() VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 30 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 515 SDtfs, 845 SDslu, 900 SDs, 0 SdLazy, 1633 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, 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, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 10974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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...