./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:58:04,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:58:04,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:58:04,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:58:04,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:58:04,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:58:04,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:58:04,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:58:04,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:58:04,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:58:04,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:58:04,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:58:04,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:58:04,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:58:04,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:58:04,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:58:04,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:58:04,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:58:04,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:58:04,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:58:04,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:58:04,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:58:04,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:58:04,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:58:04,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:58:04,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:58:04,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:58:04,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:58:04,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:58:04,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:58:04,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:58:04,827 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:58:04,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:58:04,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:58:04,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:58:04,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:58:04,829 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-09 23:58:04,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:58:04,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:58:04,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:58:04,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:58:04,837 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:58:04,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-09 23:58:04,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:58:04,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 23:58:04,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 23:58:04,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 23:58:04,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:58:04,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 23:58:04,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:58:04,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 23:58:04,840 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_276fe860-e831-4601-8dd9-96bfe19f5879/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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2018-11-09 23:58:04,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:58:04,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:58:04,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:58:04,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:58:04,874 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:58:04,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-09 23:58:04,917 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/data/4c6153630/778820a6ce27447ba7b1363c4785b60f/FLAG65e743d4a [2018-11-09 23:58:05,309 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:58:05,309 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-09 23:58:05,313 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/data/4c6153630/778820a6ce27447ba7b1363c4785b60f/FLAG65e743d4a [2018-11-09 23:58:05,324 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/data/4c6153630/778820a6ce27447ba7b1363c4785b60f [2018-11-09 23:58:05,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:58:05,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 23:58:05,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:58:05,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:58:05,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:58:05,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2225ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05, skipping insertion in model container [2018-11-09 23:58:05,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:58:05,348 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:58:05,436 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:58:05,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:58:05,450 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:58:05,459 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:58:05,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05 WrapperNode [2018-11-09 23:58:05,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:58:05,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:58:05,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:58:05,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:58:05,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... [2018-11-09 23:58:05,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:58:05,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:58:05,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:58:05,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:58:05,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/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-09 23:58:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 23:58:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:58:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 23:58:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-09 23:58:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-09 23:58:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 23:58:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:58:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-09 23:58:05,724 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:58:05,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:58:05 BoogieIcfgContainer [2018-11-09 23:58:05,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:58:05,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 23:58:05,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 23:58:05,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 23:58:05,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:58:05" (1/3) ... [2018-11-09 23:58:05,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291f1fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:05, skipping insertion in model container [2018-11-09 23:58:05,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:05" (2/3) ... [2018-11-09 23:58:05,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291f1fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:05, skipping insertion in model container [2018-11-09 23:58:05,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:58:05" (3/3) ... [2018-11-09 23:58:05,730 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2018-11-09 23:58:05,737 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 23:58:05,744 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-09 23:58:05,755 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-09 23:58:05,777 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:58:05,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 23:58:05,778 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-09 23:58:05,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 23:58:05,778 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:58:05,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:58:05,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 23:58:05,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:58:05,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 23:58:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-09 23:58:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-09 23:58:05,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:05,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:05,802 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:05,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash -196645648, now seen corresponding path program 1 times [2018-11-09 23:58:05,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:05,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:05,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:05,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:05,900 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-09 23:58:05,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:05,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:58:05,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-09 23:58:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 23:58:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 23:58:05,914 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-09 23:58:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:05,928 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-09 23:58:05,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 23:58:05,930 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-09 23:58:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:05,938 INFO L225 Difference]: With dead ends: 31 [2018-11-09 23:58:05,938 INFO L226 Difference]: Without dead ends: 28 [2018-11-09 23:58:05,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 23:58:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-09 23:58:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-09 23:58:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-09 23:58:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-09 23:58:05,960 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 9 [2018-11-09 23:58:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:05,961 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-09 23:58:05,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-09 23:58:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-09 23:58:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-09 23:58:05,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:05,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:05,962 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:05,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1801060632, now seen corresponding path program 1 times [2018-11-09 23:58:05,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:05,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,002 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-09 23:58:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:58:06,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 23:58:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:58:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:58:06,004 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-11-09 23:58:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,031 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-09 23:58:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:58:06,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-09 23:58:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,032 INFO L225 Difference]: With dead ends: 35 [2018-11-09 23:58:06,032 INFO L226 Difference]: Without dead ends: 35 [2018-11-09 23:58:06,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 23:58:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-09 23:58:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-09 23:58:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-09 23:58:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-09 23:58:06,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 10 [2018-11-09 23:58:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,035 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-09 23:58:06,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 23:58:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-09 23:58:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-09 23:58:06,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,036 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1801060578, now seen corresponding path program 1 times [2018-11-09 23:58:06,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,076 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-09 23:58:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:58:06,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 23:58:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:58:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:58:06,077 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 4 states. [2018-11-09 23:58:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,112 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-09 23:58:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:58:06,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-09 23:58:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,113 INFO L225 Difference]: With dead ends: 31 [2018-11-09 23:58:06,113 INFO L226 Difference]: Without dead ends: 31 [2018-11-09 23:58:06,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:58:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-09 23:58:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-09 23:58:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-09 23:58:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-09 23:58:06,115 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 10 [2018-11-09 23:58:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,116 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-09 23:58:06,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 23:58:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-09 23:58:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-09 23:58:06,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,116 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1801060577, now seen corresponding path program 1 times [2018-11-09 23:58:06,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,183 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-09 23:58:06,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:58:06,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 23:58:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:58:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:58:06,184 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-11-09 23:58:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,252 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-09 23:58:06,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:58:06,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-09 23:58:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,253 INFO L225 Difference]: With dead ends: 31 [2018-11-09 23:58:06,253 INFO L226 Difference]: Without dead ends: 31 [2018-11-09 23:58:06,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:58:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-09 23:58:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-09 23:58:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-09 23:58:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-09 23:58:06,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 10 [2018-11-09 23:58:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,255 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-09 23:58:06,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 23:58:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-09 23:58:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-09 23:58:06,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,256 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,256 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -523019113, now seen corresponding path program 1 times [2018-11-09 23:58:06,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-09 23:58:06,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:58:06,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 23:58:06,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:58:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:58:06,282 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 4 states. [2018-11-09 23:58:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,292 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-09 23:58:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:58:06,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-09 23:58:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,293 INFO L225 Difference]: With dead ends: 31 [2018-11-09 23:58:06,293 INFO L226 Difference]: Without dead ends: 31 [2018-11-09 23:58:06,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:58:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-09 23:58:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-09 23:58:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-09 23:58:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-09 23:58:06,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-11-09 23:58:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,296 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-09 23:58:06,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 23:58:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-09 23:58:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-09 23:58:06,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,296 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,297 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash -523019058, now seen corresponding path program 1 times [2018-11-09 23:58:06,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:58:06,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-09 23:58:06,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 23:58:06,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 23:58:06,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:58:06,427 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-09 23:58:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,494 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-09 23:58:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:58:06,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-09 23:58:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,495 INFO L225 Difference]: With dead ends: 31 [2018-11-09 23:58:06,495 INFO L226 Difference]: Without dead ends: 31 [2018-11-09 23:58:06,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:58:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-09 23:58:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-09 23:58:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-09 23:58:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-09 23:58:06,498 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2018-11-09 23:58:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,498 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-09 23:58:06,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 23:58:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-09 23:58:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-09 23:58:06,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,499 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,499 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 879012134, now seen corresponding path program 1 times [2018-11-09 23:58:06,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:06,524 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:06,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:06,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-09 23:58:06,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 23:58:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 23:58:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:58:06,587 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-11-09 23:58:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,600 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-09 23:58:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:58:06,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-09 23:58:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,600 INFO L225 Difference]: With dead ends: 33 [2018-11-09 23:58:06,601 INFO L226 Difference]: Without dead ends: 33 [2018-11-09 23:58:06,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-09 23:58:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-09 23:58:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-09 23:58:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-09 23:58:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-09 23:58:06,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2018-11-09 23:58:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,604 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-09 23:58:06,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 23:58:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-09 23:58:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-09 23:58:06,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,605 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,605 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 984410069, now seen corresponding path program 2 times [2018-11-09 23:58:06,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:06,647 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:06,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:58:06,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 23:58:06,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:06,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:06,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-09 23:58:06,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 23:58:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:58:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:58:06,722 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-11-09 23:58:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,745 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-09 23:58:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:58:06,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-09 23:58:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,746 INFO L225 Difference]: With dead ends: 38 [2018-11-09 23:58:06,746 INFO L226 Difference]: Without dead ends: 38 [2018-11-09 23:58:06,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:58:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-09 23:58:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-09 23:58:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-09 23:58:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-09 23:58:06,749 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2018-11-09 23:58:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,749 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-09 23:58:06,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 23:58:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-09 23:58:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 23:58:06,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,750 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,751 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -662995322, now seen corresponding path program 3 times [2018-11-09 23:58:06,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:06,808 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-09 23:58:06,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-09 23:58:06,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:06,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-09 23:58:06,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 23:58:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 23:58:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:58:06,869 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 7 states. [2018-11-09 23:58:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:06,887 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-09 23:58:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 23:58:06,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-09 23:58:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:06,888 INFO L225 Difference]: With dead ends: 43 [2018-11-09 23:58:06,888 INFO L226 Difference]: Without dead ends: 43 [2018-11-09 23:58:06,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-09 23:58:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-09 23:58:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-09 23:58:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-09 23:58:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-09 23:58:06,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2018-11-09 23:58:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:06,891 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-09 23:58:06,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 23:58:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-09 23:58:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-09 23:58:06,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:06,891 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:06,892 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:06,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash -798724491, now seen corresponding path program 4 times [2018-11-09 23:58:06,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:06,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:06,954 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:06,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-09 23:58:06,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-09 23:58:06,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:06,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-09 23:58:07,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-09 23:58:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-09 23:58:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-09 23:58:07,004 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 8 states. [2018-11-09 23:58:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,038 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-09 23:58:07,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-09 23:58:07,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-09 23:58:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,040 INFO L225 Difference]: With dead ends: 48 [2018-11-09 23:58:07,040 INFO L226 Difference]: Without dead ends: 48 [2018-11-09 23:58:07,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-09 23:58:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-09 23:58:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-09 23:58:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-09 23:58:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-09 23:58:07,043 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 33 [2018-11-09 23:58:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,043 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-09 23:58:07,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-09 23:58:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-09 23:58:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-09 23:58:07,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,044 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,044 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,044 INFO L82 PathProgramCache]: Analyzing trace with hash -141616154, now seen corresponding path program 5 times [2018-11-09 23:58:07,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:07,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:07,101 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-09 23:58:07,130 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-09 23:58:07,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:07,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-09 23:58:07,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-09 23:58:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-09 23:58:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:58:07,159 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2018-11-09 23:58:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,192 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-09 23:58:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 23:58:07,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-09 23:58:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,194 INFO L225 Difference]: With dead ends: 53 [2018-11-09 23:58:07,194 INFO L226 Difference]: Without dead ends: 53 [2018-11-09 23:58:07,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-09 23:58:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-09 23:58:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-09 23:58:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-09 23:58:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-09 23:58:07,196 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 38 [2018-11-09 23:58:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,196 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-09 23:58:07,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-09 23:58:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-09 23:58:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-09 23:58:07,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,197 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,197 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1310970603, now seen corresponding path program 6 times [2018-11-09 23:58:07,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:07,278 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-09 23:58:07,317 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-09 23:58:07,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:07,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-09 23:58:07,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-09 23:58:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 23:58:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:58:07,345 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 10 states. [2018-11-09 23:58:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,376 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-09 23:58:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-09 23:58:07,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-09 23:58:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,382 INFO L225 Difference]: With dead ends: 58 [2018-11-09 23:58:07,382 INFO L226 Difference]: Without dead ends: 58 [2018-11-09 23:58:07,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:58:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-09 23:58:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-11-09 23:58:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-09 23:58:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-09 23:58:07,386 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 43 [2018-11-09 23:58:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,387 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-09 23:58:07,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-09 23:58:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-09 23:58:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-09 23:58:07,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,388 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,388 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1304067770, now seen corresponding path program 7 times [2018-11-09 23:58:07,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:07,481 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-09 23:58:07,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-09 23:58:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-09 23:58:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:58:07,544 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 11 states. [2018-11-09 23:58:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,581 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-09 23:58:07,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 23:58:07,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-09 23:58:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,582 INFO L225 Difference]: With dead ends: 63 [2018-11-09 23:58:07,582 INFO L226 Difference]: Without dead ends: 63 [2018-11-09 23:58:07,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-09 23:58:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-09 23:58:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-09 23:58:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-09 23:58:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-09 23:58:07,585 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 48 [2018-11-09 23:58:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,586 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-09 23:58:07,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-09 23:58:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-09 23:58:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-09 23:58:07,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,586 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,586 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 908993461, now seen corresponding path program 8 times [2018-11-09 23:58:07,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:58:07,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:07,656 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:07,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 23:58:07,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 23:58:07,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:07,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-09 23:58:07,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-09 23:58:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-09 23:58:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:58:07,739 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 12 states. [2018-11-09 23:58:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,776 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-09 23:58:07,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 23:58:07,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-09 23:58:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,776 INFO L225 Difference]: With dead ends: 68 [2018-11-09 23:58:07,776 INFO L226 Difference]: Without dead ends: 68 [2018-11-09 23:58:07,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-09 23:58:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-09 23:58:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-11-09 23:58:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-09 23:58:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-09 23:58:07,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 53 [2018-11-09 23:58:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,782 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-09 23:58:07,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-09 23:58:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-09 23:58:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-09 23:58:07,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,783 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,783 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 298102438, now seen corresponding path program 9 times [2018-11-09 23:58:07,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:58:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:58:07,861 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:58:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-09 23:58:07,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-09 23:58:07,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 23:58:07,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:58:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:58:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:58:07,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-09 23:58:07,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-09 23:58:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-09 23:58:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-09 23:58:07,941 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 13 states. [2018-11-09 23:58:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:58:07,966 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-09 23:58:07,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-09 23:58:07,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-09 23:58:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 23:58:07,967 INFO L225 Difference]: With dead ends: 70 [2018-11-09 23:58:07,967 INFO L226 Difference]: Without dead ends: 70 [2018-11-09 23:58:07,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-09 23:58:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-09 23:58:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-09 23:58:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-09 23:58:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-09 23:58:07,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 58 [2018-11-09 23:58:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 23:58:07,970 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-09 23:58:07,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-09 23:58:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-09 23:58:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-09 23:58:07,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 23:58:07,971 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:58:07,971 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION]=== [2018-11-09 23:58:07,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:58:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash 468996693, now seen corresponding path program 10 times [2018-11-09 23:58:07,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:58:07,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:58:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:58:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:58:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:58:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:58:08,016 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-09 23:58:08,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:58:08 BoogieIcfgContainer [2018-11-09 23:58:08,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 23:58:08,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:58:08,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:58:08,045 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:58:08,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:58:05" (3/4) ... [2018-11-09 23:58:08,047 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-09 23:58:08,092 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_276fe860-e831-4601-8dd9-96bfe19f5879/bin-2019/uautomizer/witness.graphml [2018-11-09 23:58:08,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:58:08,093 INFO L168 Benchmark]: Toolchain (without parser) took 2766.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -44.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,094 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:58:08,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,094 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,095 INFO L168 Benchmark]: RCFGBuilder took 243.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,095 INFO L168 Benchmark]: TraceAbstraction took 2319.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,095 INFO L168 Benchmark]: Witness Printer took 47.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-09 23:58:08,097 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 243.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2319.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 11.5 GB. * Witness Printer took 47.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] EXPR, FCALL malloc(10 * sizeof(int)) VAL [malloc(10 * sizeof(int))={42:0}] [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] FCALL free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L16] FCALL p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 7 error locations. UNSAFE Result, 2.2s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 323 SDtfs, 313 SDslu, 1053 SDs, 0 SdLazy, 330 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=15, 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, 15 MinimizatonAttempts, 43 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 816 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 72506 SizeOfPredicates, 9 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 5/1385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...