./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:23:53,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:23:53,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:23:53,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:23:53,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:23:53,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:23:53,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:23:53,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:23:53,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:23:53,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:23:53,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:23:53,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:23:53,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:23:53,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:23:53,556 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:23:53,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:23:53,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:23:53,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:23:53,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:23:53,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:23:53,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:23:53,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:23:53,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:23:53,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:23:53,563 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:23:53,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:23:53,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:23:53,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:23:53,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:23:53,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:23:53,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:23:53,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:23:53,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:23:53,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:23:53,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:23:53,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:23:53,568 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-12-02 01:23:53,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:23:53,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:23:53,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:23:53,576 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:23:53,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:23:53,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:23:53,577 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:23:53,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:23:53,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 01:23:53,578 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:23:53,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:23:53,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:23:53,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:23:53,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:23:53,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:23:53,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:23:53,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:23:53,580 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_3c43e419-acce-480c-b219-0da13b29a178/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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-12-02 01:23:53,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:23:53,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:23:53,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:23:53,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:23:53,613 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:23:53,613 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:23:53,648 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/data/b4ee4017d/c2e123c9453040f6873bbd4aaee73df0/FLAGab931c356 [2018-12-02 01:23:53,964 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:23:53,965 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:23:53,970 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/data/b4ee4017d/c2e123c9453040f6873bbd4aaee73df0/FLAGab931c356 [2018-12-02 01:23:53,978 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/data/b4ee4017d/c2e123c9453040f6873bbd4aaee73df0 [2018-12-02 01:23:53,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:23:53,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 01:23:53,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:23:53,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:23:53,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:23:53,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:23:53" (1/1) ... [2018-12-02 01:23:53,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b87e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:53, skipping insertion in model container [2018-12-02 01:23:53,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:23:53" (1/1) ... [2018-12-02 01:23:53,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:23:54,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:23:54,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:23:54,200 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:23:54,224 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:23:54,244 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:23:54,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54 WrapperNode [2018-12-02 01:23:54,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:23:54,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:23:54,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:23:54,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:23:54,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... [2018-12-02 01:23:54,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:23:54,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:23:54,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:23:54,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:23:54,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-12-02 01:23:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:23:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:23:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 01:23:54,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 01:23:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 01:23:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 01:23:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 01:23:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 01:23:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 01:23:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 01:23:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 01:23:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:23:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:23:54,553 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:23:54,553 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 01:23:54,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:23:54 BoogieIcfgContainer [2018-12-02 01:23:54,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:23:54,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:23:54,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:23:54,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:23:54,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:23:53" (1/3) ... [2018-12-02 01:23:54,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a7503c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:23:54, skipping insertion in model container [2018-12-02 01:23:54,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:23:54" (2/3) ... [2018-12-02 01:23:54,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a7503c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:23:54, skipping insertion in model container [2018-12-02 01:23:54,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:23:54" (3/3) ... [2018-12-02 01:23:54,558 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 01:23:54,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:23:54,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-02 01:23:54,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-02 01:23:54,596 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:23:54,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:23:54,597 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 01:23:54,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:23:54,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:23:54,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:23:54,597 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:23:54,597 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:23:54,597 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:23:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-12-02 01:23:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 01:23:54,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:54,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:54,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1038621538, now seen corresponding path program 1 times [2018-12-02 01:23:54,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:54,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:54,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:54,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:54,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:23:54,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 01:23:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 01:23:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 01:23:54,709 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-12-02 01:23:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:54,721 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-12-02 01:23:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 01:23:54,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 01:23:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:54,726 INFO L225 Difference]: With dead ends: 76 [2018-12-02 01:23:54,726 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 01:23:54,727 INFO L631 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-12-02 01:23:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 01:23:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 01:23:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 01:23:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-02 01:23:54,749 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-12-02 01:23:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:54,749 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-02 01:23:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 01:23:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-02 01:23:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 01:23:54,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:54,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:54,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532259, now seen corresponding path program 1 times [2018-12-02 01:23:54,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:23:54,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:23:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:23:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:23:54,791 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-12-02 01:23:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:54,884 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-12-02 01:23:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:23:54,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 01:23:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:54,886 INFO L225 Difference]: With dead ends: 85 [2018-12-02 01:23:54,886 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 01:23:54,886 INFO L631 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-12-02 01:23:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 01:23:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-12-02 01:23:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 01:23:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-12-02 01:23:54,892 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-12-02 01:23:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:54,892 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-02 01:23:54,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:23:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-12-02 01:23:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 01:23:54,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:54,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:54,893 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:54,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532258, now seen corresponding path program 1 times [2018-12-02 01:23:54,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:54,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:54,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:54,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:54,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:54,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:23:54,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:23:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:23:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:23:54,929 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-12-02 01:23:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,008 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-12-02 01:23:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:23:55,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 01:23:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,009 INFO L225 Difference]: With dead ends: 93 [2018-12-02 01:23:55,009 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 01:23:55,009 INFO L631 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-12-02 01:23:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 01:23:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-12-02 01:23:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 01:23:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-02 01:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-12-02 01:23:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,013 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-02 01:23:55,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:23:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-02 01:23:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:23:55,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,014 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1219409795, now seen corresponding path program 1 times [2018-12-02 01:23:55,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:23:55,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:23:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:23:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:23:55,065 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-12-02 01:23:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,162 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-12-02 01:23:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:23:55,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 01:23:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,163 INFO L225 Difference]: With dead ends: 122 [2018-12-02 01:23:55,163 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 01:23:55,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:23:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 01:23:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-12-02 01:23:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 01:23:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-12-02 01:23:55,168 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-12-02 01:23:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,168 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-12-02 01:23:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:23:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-12-02 01:23:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:23:55,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1219362099, now seen corresponding path program 1 times [2018-12-02 01:23:55,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:23:55,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:23:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:23:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:23:55,202 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-12-02 01:23:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,258 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-12-02 01:23:55,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:23:55,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 01:23:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,259 INFO L225 Difference]: With dead ends: 116 [2018-12-02 01:23:55,259 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 01:23:55,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:23:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 01:23:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-12-02 01:23:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 01:23:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-12-02 01:23:55,264 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-12-02 01:23:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,264 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-12-02 01:23:55,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:23:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-12-02 01:23:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:23:55,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,265 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,265 INFO L82 PathProgramCache]: Analyzing trace with hash 48910251, now seen corresponding path program 1 times [2018-12-02 01:23:55,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:23:55,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:23:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:23:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:23:55,279 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-12-02 01:23:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,289 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-12-02 01:23:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:23:55,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 01:23:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,290 INFO L225 Difference]: With dead ends: 159 [2018-12-02 01:23:55,290 INFO L226 Difference]: Without dead ends: 159 [2018-12-02 01:23:55,290 INFO L631 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-12-02 01:23:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-02 01:23:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-12-02 01:23:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 01:23:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-12-02 01:23:55,295 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-12-02 01:23:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,295 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-12-02 01:23:55,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:23:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-12-02 01:23:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:23:55,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash -246914379, now seen corresponding path program 1 times [2018-12-02 01:23:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:23:55,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:23:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:23:55,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:23:55,327 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-12-02 01:23:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,431 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-12-02 01:23:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:23:55,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 01:23:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,431 INFO L225 Difference]: With dead ends: 127 [2018-12-02 01:23:55,432 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 01:23:55,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:23:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 01:23:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-12-02 01:23:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 01:23:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-12-02 01:23:55,435 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-12-02 01:23:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,436 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-12-02 01:23:55,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:23:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-12-02 01:23:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 01:23:55,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,436 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 854480748, now seen corresponding path program 1 times [2018-12-02 01:23:55,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:23:55,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:23:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:23:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:23:55,471 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-12-02 01:23:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,585 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-02 01:23:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:23:55,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 01:23:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,585 INFO L225 Difference]: With dead ends: 108 [2018-12-02 01:23:55,585 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 01:23:55,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:23:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 01:23:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-12-02 01:23:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 01:23:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-12-02 01:23:55,589 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-12-02 01:23:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,589 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-12-02 01:23:55,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:23:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-12-02 01:23:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 01:23:55,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,590 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash -810428214, now seen corresponding path program 1 times [2018-12-02 01:23:55,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:23:55,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:23:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:23:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:23:55,627 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-12-02 01:23:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,748 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-12-02 01:23:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:23:55,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 01:23:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,749 INFO L225 Difference]: With dead ends: 103 [2018-12-02 01:23:55,749 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 01:23:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:23:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 01:23:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 01:23:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 01:23:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-02 01:23:55,752 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-12-02 01:23:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-02 01:23:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:23:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-02 01:23:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 01:23:55,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,752 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,753 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -810428213, now seen corresponding path program 1 times [2018-12-02 01:23:55,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:23:55,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:23:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:23:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:23:55,809 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-12-02 01:23:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:55,943 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-02 01:23:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:23:55,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 01:23:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:55,944 INFO L225 Difference]: With dead ends: 112 [2018-12-02 01:23:55,944 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 01:23:55,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:23:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 01:23:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-12-02 01:23:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 01:23:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-02 01:23:55,947 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-12-02 01:23:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:55,947 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-02 01:23:55,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:23:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-02 01:23:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 01:23:55,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:55,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:55,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:55,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 719099552, now seen corresponding path program 1 times [2018-12-02 01:23:55,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:55,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:55,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:23:55,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:23:55,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:23:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:23:55,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:23:55,996 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-02 01:23:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:56,115 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-02 01:23:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:23:56,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 01:23:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:56,116 INFO L225 Difference]: With dead ends: 105 [2018-12-02 01:23:56,116 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 01:23:56,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:23:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 01:23:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-12-02 01:23:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 01:23:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-02 01:23:56,118 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-12-02 01:23:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:56,119 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-02 01:23:56,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:23:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-02 01:23:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:23:56,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:56,120 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:56,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:56,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1968452048, now seen corresponding path program 1 times [2018-12-02 01:23:56,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:56,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:56,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:56,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:56,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:23:56,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-12-02 01:23:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:56,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:23:56,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 01:23:56,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 01:23:56,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 01:23:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:56,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-02 01:23:56,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:56,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:56,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 01:23:56,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-02 01:23:56,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:23:56,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:23:56,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 01:23:56,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:56,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:23:56,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-12-02 01:23:56,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 01:23:56,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:23:56,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-12-02 01:23:56,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 01:23:56,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:56,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:23:56,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-02 01:23:56,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 01:23:56,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:23:56,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 01:23:56,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:56,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-02 01:23:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:56,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:23:56,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-12-02 01:23:56,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 01:23:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 01:23:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:23:56,566 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-12-02 01:23:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:57,026 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-12-02 01:23:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 01:23:57,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-02 01:23:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:57,027 INFO L225 Difference]: With dead ends: 179 [2018-12-02 01:23:57,027 INFO L226 Difference]: Without dead ends: 179 [2018-12-02 01:23:57,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-12-02 01:23:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-02 01:23:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-12-02 01:23:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 01:23:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-12-02 01:23:57,031 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-12-02 01:23:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:57,031 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-12-02 01:23:57,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 01:23:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-12-02 01:23:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:23:57,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:57,032 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:57,032 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:57,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash -995956632, now seen corresponding path program 1 times [2018-12-02 01:23:57,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:57,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:57,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:23:57,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-12-02 01:23:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:57,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:23:57,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 01:23:57,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 01:23:57,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 01:23:57,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:57,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 01:23:57,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:57,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:57,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 01:23:57,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-12-02 01:23:57,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 01:23:57,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:57,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:23:57,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:23:57,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:23:57,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-12-02 01:23:57,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 01:23:57,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:23:57,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-12-02 01:23:57,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 01:23:57,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:57,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:23:57,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-12-02 01:23:57,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 01:23:57,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 01:23:57,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:23:57,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:57,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-12-02 01:23:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:23:57,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-02 01:23:57,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 01:23:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 01:23:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:23:57,485 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-12-02 01:23:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:57,948 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-12-02 01:23:57,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 01:23:57,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-02 01:23:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:57,949 INFO L225 Difference]: With dead ends: 133 [2018-12-02 01:23:57,949 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 01:23:57,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 01:23:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 01:23:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-12-02 01:23:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 01:23:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-12-02 01:23:57,951 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-12-02 01:23:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:57,952 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-12-02 01:23:57,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 01:23:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-12-02 01:23:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 01:23:57,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:57,952 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:57,953 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:57,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1031908765, now seen corresponding path program 1 times [2018-12-02 01:23:57,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:57,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:58,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:23:58,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-12-02 01:23:58,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:58,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:23:58,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 01:23:58,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 01:23:58,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 01:23:58,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:58,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-02 01:23:58,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 01:23:58,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-02 01:23:58,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:23:58,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:23:58,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 01:23:58,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:23:58,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-02 01:23:58,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 01:23:58,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:23:58,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-02 01:23:58,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 01:23:58,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:58,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-02 01:23:58,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 01:23:58,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-12-02 01:23:58,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:23:58,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:23:58,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 01:23:58,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:23:58,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-02 01:23:58,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 01:23:58,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:23:58,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:23:58,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-12-02 01:23:58,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-02 01:23:58,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-02 01:23:58,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:58,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-12-02 01:23:58,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 01:23:58,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:23:58,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 01:23:58,552 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-12-02 01:23:58,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 01:23:58,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:23:58,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 01:23:58,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:58,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-12-02 01:23:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:58,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:23:58,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-12-02 01:23:58,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 01:23:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 01:23:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-12-02 01:23:58,643 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-12-02 01:23:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:59,518 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-12-02 01:23:59,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 01:23:59,518 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-12-02 01:23:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:59,518 INFO L225 Difference]: With dead ends: 92 [2018-12-02 01:23:59,518 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 01:23:59,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=386, Invalid=2064, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 01:23:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 01:23:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-02 01:23:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 01:23:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-12-02 01:23:59,521 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-12-02 01:23:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:59,521 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-12-02 01:23:59,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 01:23:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-12-02 01:23:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 01:23:59,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:59,522 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:59,522 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2018-12-02 01:23:59,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2004404181, now seen corresponding path program 1 times [2018-12-02 01:23:59,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:59,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:59,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:23:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:23:59,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/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-12-02 01:23:59,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:59,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:23:59,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 01:23:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 01:23:59,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 01:23:59,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:59,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 01:23:59,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 01:23:59,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-12-02 01:23:59,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 01:23:59,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:23:59,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:23:59,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:23:59,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-12-02 01:23:59,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-02 01:23:59,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-02 01:23:59,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-12-02 01:23:59,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 01:23:59,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:23:59,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:59,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-02 01:23:59,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:23:59,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:23:59,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-12-02 01:24:00,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:24:00,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:24:00,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 01:24:00,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:24:00,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 01:24:00,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-12-02 01:24:00,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-02 01:24:00,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-12-02 01:24:00,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:24:00,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-12-02 01:24:00,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-02 01:24:00,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 01:24:00,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:24:00,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-12-02 01:24:00,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-02 01:24:00,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:24:00,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:24:00,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 01:24:00,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:24:00,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-12-02 01:24:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:24:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:24:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-12-02 01:24:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 01:24:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 01:24:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-12-02 01:24:00,257 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-12-02 01:24:00,918 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-12-02 01:24:01,911 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-12-02 01:24:02,160 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-02 01:24:02,815 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-02 01:24:03,121 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-12-02 01:24:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:24:03,160 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-02 01:24:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 01:24:03,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-12-02 01:24:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:24:03,161 INFO L225 Difference]: With dead ends: 79 [2018-12-02 01:24:03,162 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 01:24:03,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 01:24:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 01:24:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 01:24:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 01:24:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 01:24:03,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-02 01:24:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:24:03,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:24:03,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 01:24:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:24:03,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 01:24:03,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:24:03 BoogieIcfgContainer [2018-12-02 01:24:03,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:24:03,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:24:03,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:24:03,179 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:24:03,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:23:54" (3/4) ... [2018-12-02 01:24:03,185 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 01:24:03,193 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 01:24:03,193 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 01:24:03,193 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 01:24:03,198 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 01:24:03,198 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 01:24:03,198 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 01:24:03,226 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c43e419-acce-480c-b219-0da13b29a178/bin-2019/uautomizer/witness.graphml [2018-12-02 01:24:03,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:24:03,226 INFO L168 Benchmark]: Toolchain (without parser) took 9245.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 949.5 MB in the beginning and 917.6 MB in the end (delta: 31.9 MB). Peak memory consumption was 354.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:24:03,227 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:24:03,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:24:03,227 INFO L168 Benchmark]: Boogie Preprocessor took 30.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-02 01:24:03,227 INFO L168 Benchmark]: RCFGBuilder took 277.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:24:03,227 INFO L168 Benchmark]: TraceAbstraction took 8624.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 170.1 MB). Peak memory consumption was 337.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:24:03,228 INFO L168 Benchmark]: Witness Printer took 47.05 ms. Allocated memory is still 1.4 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:24:03,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 277.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8624.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 170.1 MB). Peak memory consumption was 337.9 MB. Max. memory is 11.5 GB. * Witness Printer took 47.05 ms. Allocated memory is still 1.4 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 8.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1525 SDslu, 2490 SDs, 0 SdLazy, 3079 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, 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, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 458 ConstructedInterpolants, 22 QuantifiedInterpolants, 141358 SizeOfPredicates, 65 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 11/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...