./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb3a1029b311511a929aa1b20bb93012329001e7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:19:28,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:19:28,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:19:28,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:19:28,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:19:28,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:19:28,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:19:28,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:19:28,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:19:28,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:19:28,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:19:28,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:19:28,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:19:28,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:19:28,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:19:28,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:19:28,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:19:28,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:19:28,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:19:28,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:19:28,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:19:28,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:19:28,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:19:28,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:19:28,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:19:28,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:19:28,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:19:28,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:19:28,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:19:28,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:19:28,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:19:28,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:19:28,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:19:28,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:19:28,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:19:28,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:19:28,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 11:19:28,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:19:28,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:19:28,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:19:28,507 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:19:28,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:19:28,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:19:28,507 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:19:28,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:19:28,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:19:28,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:19:28,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:19:28,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb3a1029b311511a929aa1b20bb93012329001e7 [2018-11-28 11:19:28,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:19:28,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:19:28,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:19:28,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:19:28,541 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:19:28,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-11-28 11:19:28,580 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/data/e780350bb/386db8f63bb14c0194dc2c0e89101111/FLAG945b68c40 [2018-11-28 11:19:29,001 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:19:29,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-11-28 11:19:29,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/data/e780350bb/386db8f63bb14c0194dc2c0e89101111/FLAG945b68c40 [2018-11-28 11:19:29,016 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/data/e780350bb/386db8f63bb14c0194dc2c0e89101111 [2018-11-28 11:19:29,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:19:29,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:19:29,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:19:29,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:19:29,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:19:29,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8801579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29, skipping insertion in model container [2018-11-28 11:19:29,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:19:29,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:19:29,249 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:19:29,255 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:19:29,325 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:19:29,348 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:19:29,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29 WrapperNode [2018-11-28 11:19:29,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:19:29,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:19:29,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:19:29,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:19:29,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... [2018-11-28 11:19:29,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:19:29,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:19:29,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:19:29,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:19:29,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:19:29,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:19:29,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:19:29,433 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-11-28 11:19:29,434 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-11-28 11:19:29,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:19:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:19:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:19:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:19:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:19:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:19:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:19:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:19:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:19:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:19:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:19:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:19:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:19:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:19:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:19:29,751 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:19:29,751 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 11:19:29,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:29 BoogieIcfgContainer [2018-11-28 11:19:29,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:19:29,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:19:29,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:19:29,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:19:29,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:19:29" (1/3) ... [2018-11-28 11:19:29,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349f6804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:19:29, skipping insertion in model container [2018-11-28 11:19:29,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:29" (2/3) ... [2018-11-28 11:19:29,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349f6804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:19:29, skipping insertion in model container [2018-11-28 11:19:29,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:29" (3/3) ... [2018-11-28 11:19:29,756 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-11-28 11:19:29,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:19:29,772 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-11-28 11:19:29,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-11-28 11:19:29,797 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:19:29,797 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:19:29,798 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:19:29,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:19:29,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:19:29,798 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:19:29,798 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:19:29,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:19:29,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:19:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-28 11:19:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:19:29,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:29,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:29,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:29,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 682489521, now seen corresponding path program 1 times [2018-11-28 11:19:29,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:29,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:29,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:19:29,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:29,967 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-11-28 11:19:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,087 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-28 11:19:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:30,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:19:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,096 INFO L225 Difference]: With dead ends: 52 [2018-11-28 11:19:30,096 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 11:19:30,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 11:19:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-28 11:19:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 11:19:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-28 11:19:30,123 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2018-11-28 11:19:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,124 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-28 11:19:30,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-28 11:19:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:19:30,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,125 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,125 INFO L82 PathProgramCache]: Analyzing trace with hash 682489522, now seen corresponding path program 1 times [2018-11-28 11:19:30,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:30,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:30,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:19:30,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:19:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:19:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:19:30,191 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-11-28 11:19:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,313 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-28 11:19:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:30,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:19:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,315 INFO L225 Difference]: With dead ends: 46 [2018-11-28 11:19:30,315 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 11:19:30,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:19:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 11:19:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-28 11:19:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 11:19:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-28 11:19:30,319 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 9 [2018-11-28 11:19:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,319 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-28 11:19:30,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:19:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-28 11:19:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 11:19:30,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,320 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1257566989, now seen corresponding path program 1 times [2018-11-28 11:19:30,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:30,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:30,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:19:30,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:19:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:19:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:19:30,402 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 7 states. [2018-11-28 11:19:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,500 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-28 11:19:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:19:30,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-28 11:19:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,501 INFO L225 Difference]: With dead ends: 45 [2018-11-28 11:19:30,501 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 11:19:30,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:19:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 11:19:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 11:19:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 11:19:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-28 11:19:30,505 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 11 [2018-11-28 11:19:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,506 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-28 11:19:30,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:19:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-28 11:19:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:19:30,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,507 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash -611666587, now seen corresponding path program 1 times [2018-11-28 11:19:30,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:30,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:30,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:19:30,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:30,543 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 3 states. [2018-11-28 11:19:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,570 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-28 11:19:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:30,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:19:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,571 INFO L225 Difference]: With dead ends: 41 [2018-11-28 11:19:30,571 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 11:19:30,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 11:19:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 11:19:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 11:19:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-28 11:19:30,574 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2018-11-28 11:19:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,574 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-28 11:19:30,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-28 11:19:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:19:30,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,575 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash -611666586, now seen corresponding path program 1 times [2018-11-28 11:19:30,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:30,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:30,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:19:30,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:30,607 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 3 states. [2018-11-28 11:19:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,626 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-28 11:19:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:30,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:19:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,627 INFO L225 Difference]: With dead ends: 37 [2018-11-28 11:19:30,627 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 11:19:30,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 11:19:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-28 11:19:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 11:19:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-28 11:19:30,630 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 18 [2018-11-28 11:19:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,630 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-28 11:19:30,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-28 11:19:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:19:30,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2025856802, now seen corresponding path program 1 times [2018-11-28 11:19:30,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:30,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:30,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:19:30,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:19:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:19:30,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:19:30,761 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-11-28 11:19:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:30,878 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-28 11:19:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:19:30,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-28 11:19:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:30,879 INFO L225 Difference]: With dead ends: 36 [2018-11-28 11:19:30,879 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 11:19:30,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:19:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 11:19:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-28 11:19:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 11:19:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-28 11:19:30,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2018-11-28 11:19:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:30,883 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-28 11:19:30,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:19:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-28 11:19:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:19:30,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:30,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:30,884 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:30,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1622948653, now seen corresponding path program 1 times [2018-11-28 11:19:30,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:31,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:31,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:19:31,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:19:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:19:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:19:31,053 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-11-28 11:19:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:31,237 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-28 11:19:31,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:19:31,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-28 11:19:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:31,238 INFO L225 Difference]: With dead ends: 35 [2018-11-28 11:19:31,238 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 11:19:31,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:19:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 11:19:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-28 11:19:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 11:19:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-28 11:19:31,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 26 [2018-11-28 11:19:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:31,240 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-28 11:19:31,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:19:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-28 11:19:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:19:31,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:31,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:31,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:31,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1228199232, now seen corresponding path program 1 times [2018-11-28 11:19:31,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:31,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:31,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:19:31,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:19:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:19:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:19:31,387 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 12 states. [2018-11-28 11:19:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:31,512 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-28 11:19:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:19:31,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-28 11:19:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:31,513 INFO L225 Difference]: With dead ends: 34 [2018-11-28 11:19:31,513 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 11:19:31,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:19:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 11:19:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 11:19:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 11:19:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-28 11:19:31,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 27 [2018-11-28 11:19:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:31,516 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-28 11:19:31,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:19:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-28 11:19:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:19:31,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:31,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:31,517 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:31,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash 579824948, now seen corresponding path program 1 times [2018-11-28 11:19:31,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:31,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:31,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 11:19:31,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:19:31,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:19:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:19:31,722 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 17 states. [2018-11-28 11:19:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:31,960 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-11-28 11:19:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:19:31,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-28 11:19:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:31,961 INFO L225 Difference]: With dead ends: 36 [2018-11-28 11:19:31,961 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 11:19:31,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:19:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 11:19:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 11:19:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 11:19:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2018-11-28 11:19:31,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 28 [2018-11-28 11:19:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:31,965 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2018-11-28 11:19:31,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:19:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2018-11-28 11:19:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:19:31,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:31,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:31,966 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:31,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 580529551, now seen corresponding path program 1 times [2018-11-28 11:19:31,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 11:19:32,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:19:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:19:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:19:32,293 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 20 states. [2018-11-28 11:19:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:32,734 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-11-28 11:19:32,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:19:32,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-28 11:19:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:32,735 INFO L225 Difference]: With dead ends: 33 [2018-11-28 11:19:32,735 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 11:19:32,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:19:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 11:19:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 11:19:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 11:19:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-11-28 11:19:32,737 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 28 [2018-11-28 11:19:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:32,737 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-11-28 11:19:32,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:19:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-11-28 11:19:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:19:32,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:32,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:32,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION]=== [2018-11-28 11:19:32,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash -943687815, now seen corresponding path program 1 times [2018-11-28 11:19:32,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:32,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:33,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-11-28 11:19:33,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 11:19:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 11:19:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-11-28 11:19:33,992 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 23 states. [2018-11-28 11:19:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:34,731 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-11-28 11:19:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:19:34,732 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-28 11:19:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:34,732 INFO L225 Difference]: With dead ends: 32 [2018-11-28 11:19:34,732 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:19:34,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:19:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:19:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:19:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:19:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:19:34,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-28 11:19:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:34,734 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:19:34,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 11:19:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:19:34,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:19:34,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:19:34 BoogieIcfgContainer [2018-11-28 11:19:34,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:19:34,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:19:34,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:19:34,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:19:34,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:29" (3/4) ... [2018-11-28 11:19:34,742 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:19:34,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:19:34,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2018-11-28 11:19:34,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:19:34,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2018-11-28 11:19:34,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 11:19:34,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 11:19:34,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:19:34,783 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_966b366d-6d28-481c-a0cb-00b8a1e24803/bin-2019/uautomizer/witness.graphml [2018-11-28 11:19:34,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:19:34,784 INFO L168 Benchmark]: Toolchain (without parser) took 5765.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -237.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:34,784 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:34,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:34,785 INFO L168 Benchmark]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:34,785 INFO L168 Benchmark]: RCFGBuilder took 366.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:19:34,785 INFO L168 Benchmark]: TraceAbstraction took 4985.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:19:34,786 INFO L168 Benchmark]: Witness Printer took 44.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 668.4 kB). Peak memory consumption was 668.4 kB. Max. memory is 11.5 GB. [2018-11-28 11:19:34,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4985.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 44.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 668.4 kB). Peak memory consumption was 668.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 21 error locations. SAFE Result, 4.9s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 233 SDslu, 954 SDs, 0 SdLazy, 1790 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 64913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...