./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:08:35,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:08:35,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:08:35,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:08:35,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:08:35,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:08:35,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:08:35,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:08:35,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:08:35,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:08:35,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:08:35,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:08:35,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:08:35,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:08:35,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:08:35,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:08:35,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:08:35,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:08:35,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:08:35,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:08:35,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:08:35,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:08:35,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:08:35,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:08:35,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:08:35,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:08:35,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:08:35,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:08:35,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:08:35,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:08:35,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:08:35,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:08:35,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:08:35,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:08:35,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:08:35,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:08:35,773 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 17:08:35,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:08:35,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:08:35,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:08:35,782 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 17:08:35,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:08:35,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:08:35,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:08:35,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:08:35,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:08:35,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:35,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:08:35,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:08:35,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:08:35,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_3199a585-0c71-4ad5-86c2-10874f03b69e/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 ! call(__VERIFIER_error())) ) 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-11-18 17:08:35,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:08:35,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:08:35,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:08:35,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:08:35,826 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:08:35,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:08:35,872 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/data/1ca4bd109/61ea3aa75e6f4230b8ae37b04f1ac01f/FLAGc18b5c7ae [2018-11-18 17:08:36,244 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:08:36,245 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:08:36,254 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/data/1ca4bd109/61ea3aa75e6f4230b8ae37b04f1ac01f/FLAGc18b5c7ae [2018-11-18 17:08:36,633 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/data/1ca4bd109/61ea3aa75e6f4230b8ae37b04f1ac01f [2018-11-18 17:08:36,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:08:36,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 17:08:36,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:36,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:08:36,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:08:36,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:36,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c37ceee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36, skipping insertion in model container [2018-11-18 17:08:36,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:36,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:08:36,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:08:36,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:36,872 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:08:36,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:08:36,981 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:08:36,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36 WrapperNode [2018-11-18 17:08:36,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:08:36,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:08:36,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:08:36,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:08:36,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:36,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:36,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:36,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:37,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:37,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:37,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... [2018-11-18 17:08:37,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:08:37,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:08:37,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:08:37,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:08:37,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:08:37,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:08:37,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:08:37,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 17:08:37,049 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-18 17:08:37,050 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-18 17:08:37,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 17:08:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 17:08:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 17:08:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 17:08:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 17:08:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 17:08:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 17:08:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 17:08:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 17:08:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 17:08:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 17:08:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 17:08:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 17:08:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 17:08:37,061 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 17:08:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 17:08:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 17:08:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 17:08:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 17:08:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 17:08:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 17:08:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 17:08:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 17:08:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:08:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:08:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:08:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:08:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:08:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 17:08:37,308 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:08:37,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:37 BoogieIcfgContainer [2018-11-18 17:08:37,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:08:37,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:08:37,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:08:37,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:08:37,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:08:36" (1/3) ... [2018-11-18 17:08:37,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:37, skipping insertion in model container [2018-11-18 17:08:37,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:08:36" (2/3) ... [2018-11-18 17:08:37,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:08:37, skipping insertion in model container [2018-11-18 17:08:37,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:37" (3/3) ... [2018-11-18 17:08:37,314 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-18 17:08:37,320 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:08:37,325 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:08:37,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:08:37,361 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:08:37,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:08:37,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:08:37,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:08:37,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:08:37,363 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:08:37,363 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:08:37,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:08:37,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:08:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-18 17:08:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 17:08:37,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:37,382 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:37,383 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:37,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1101714923, now seen corresponding path program 1 times [2018-11-18 17:08:37,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:37,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:37,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:08:37,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:08:37,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:08:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:37,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 17:08:37,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:08:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-18 17:08:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:08:37,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:08:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:08:37,726 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2018-11-18 17:08:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:37,967 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2018-11-18 17:08:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 17:08:37,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-18 17:08:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:37,982 INFO L225 Difference]: With dead ends: 102 [2018-11-18 17:08:37,982 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 17:08:37,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:08:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 17:08:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2018-11-18 17:08:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 17:08:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 17:08:38,029 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 45 [2018-11-18 17:08:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:38,030 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 17:08:38,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:08:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 17:08:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:08:38,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:38,032 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:38,033 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:38,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2012418106, now seen corresponding path program 1 times [2018-11-18 17:08:38,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 17:08:38,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:38,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 17:08:38,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:08:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:08:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:08:38,211 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2018-11-18 17:08:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:38,421 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 17:08:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:08:38,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-18 17:08:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:38,423 INFO L225 Difference]: With dead ends: 59 [2018-11-18 17:08:38,424 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 17:08:38,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-18 17:08:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 17:08:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-18 17:08:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 17:08:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-18 17:08:38,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 48 [2018-11-18 17:08:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:38,431 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-18 17:08:38,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:08:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 17:08:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:08:38,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:38,432 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:38,432 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:38,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1889522180, now seen corresponding path program 1 times [2018-11-18 17:08:38,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:38,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 17:08:38,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:08:38,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:08:38,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:08:38,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:08:38,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:08:38,524 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2018-11-18 17:08:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:38,642 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-18 17:08:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:08:38,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-18 17:08:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:38,643 INFO L225 Difference]: With dead ends: 57 [2018-11-18 17:08:38,644 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 17:08:38,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:08:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 17:08:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 17:08:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 17:08:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 17:08:38,650 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 48 [2018-11-18 17:08:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:38,651 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 17:08:38,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:08:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 17:08:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 17:08:38,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:38,652 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:38,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:38,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1846463888, now seen corresponding path program 1 times [2018-11-18 17:08:38,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 17:08:39,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:08:39,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:08:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:39,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:39,171 INFO L477 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-11-18 17:08:39,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:08:39,197 INFO L477 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-11-18 17:08:39,199 INFO L477 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-11-18 17:08:39,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 17:08:39,313 INFO L477 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-11-18 17:08:39,316 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:39,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,328 INFO L477 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-11-18 17:08:39,330 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:39,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:39,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 17:08:39,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:38 [2018-11-18 17:08:40,101 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 17:08:40,528 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 17:08:40,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:40,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:40,539 INFO L477 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 17 treesize of output 10 [2018-11-18 17:08:40,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,549 INFO L477 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 31 treesize of output 38 [2018-11-18 17:08:40,551 INFO L477 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-11-18 17:08:40,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,563 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:33 [2018-11-18 17:08:40,782 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 17:08:40,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:40,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:1 [2018-11-18 17:08:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:08:40,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:08:40,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2018-11-18 17:08:40,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 17:08:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 17:08:40,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1026, Unknown=1, NotChecked=0, Total=1122 [2018-11-18 17:08:40,808 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 34 states. [2018-11-18 17:08:42,596 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-11-18 17:08:43,640 WARN L180 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-18 17:08:45,296 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-18 17:08:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:45,909 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-18 17:08:45,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 17:08:45,910 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2018-11-18 17:08:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:45,911 INFO L225 Difference]: With dead ends: 69 [2018-11-18 17:08:45,911 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 17:08:45,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=293, Invalid=2462, Unknown=1, NotChecked=0, Total=2756 [2018-11-18 17:08:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 17:08:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-18 17:08:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 17:08:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 17:08:45,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 52 [2018-11-18 17:08:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:45,923 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 17:08:45,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 17:08:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 17:08:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 17:08:45,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:45,925 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 17:08:45,925 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:45,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1254092774, now seen corresponding path program 2 times [2018-11-18 17:08:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:08:46,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:08:46,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:08:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:08:46,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:08:46,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:08:46,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:46,845 INFO L477 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-11-18 17:08:46,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:46,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:46,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:08:46,880 INFO L477 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-11-18 17:08:46,881 INFO L477 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-11-18 17:08:46,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:46,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:46,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:46,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-18 17:08:47,038 INFO L477 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-11-18 17:08:47,041 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:47,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,055 INFO L477 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-11-18 17:08:47,057 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:47,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 17:08:47,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:44 [2018-11-18 17:08:47,464 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 17:08:47,834 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 17:08:47,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:47,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:47,842 INFO L477 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 23 treesize of output 39 [2018-11-18 17:08:47,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,856 INFO L477 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 31 treesize of output 38 [2018-11-18 17:08:47,859 INFO L477 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-11-18 17:08:47,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:47,869 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:49 [2018-11-18 17:08:48,551 WARN L180 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 17:08:49,171 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 17:08:49,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:49,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:49,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:49,195 INFO L477 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 20 treesize of output 21 [2018-11-18 17:08:49,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,219 INFO L477 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 27 treesize of output 32 [2018-11-18 17:08:49,221 INFO L477 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-11-18 17:08:49,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:49,240 INFO L477 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 45 treesize of output 57 [2018-11-18 17:08:49,242 INFO L477 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 22 treesize of output 18 [2018-11-18 17:08:49,243 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:49,261 INFO L477 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 29 treesize of output 36 [2018-11-18 17:08:49,263 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:49,263 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,274 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:83, output treesize:74 [2018-11-18 17:08:49,681 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 17:08:49,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:49,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:128, output treesize:1 [2018-11-18 17:08:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:08:49,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:08:49,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 46 [2018-11-18 17:08:49,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-18 17:08:49,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 17:08:49,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 17:08:49,722 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 46 states. [2018-11-18 17:08:51,410 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-11-18 17:08:52,595 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-18 17:08:54,444 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2018-11-18 17:08:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:55,398 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-11-18 17:08:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 17:08:55,398 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-11-18 17:08:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:55,399 INFO L225 Difference]: With dead ends: 74 [2018-11-18 17:08:55,399 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 17:08:55,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=365, Invalid=3795, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 17:08:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 17:08:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-11-18 17:08:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 17:08:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-18 17:08:55,409 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 56 [2018-11-18 17:08:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:55,410 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-18 17:08:55,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-18 17:08:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-18 17:08:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 17:08:55,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:55,411 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:55,411 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:55,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1647119784, now seen corresponding path program 1 times [2018-11-18 17:08:55,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:55,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:08:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:08:55,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:08:55,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:08:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:08:55,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:08:55,887 INFO L477 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-11-18 17:08:55,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 17:08:55,897 INFO L477 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-11-18 17:08:55,898 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:55,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 17:08:55,933 INFO L477 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-11-18 17:08:55,934 INFO L477 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 10 treesize of output 9 [2018-11-18 17:08:55,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:55,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-18 17:08:55,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:55,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:08:55,988 INFO L477 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-11-18 17:08:55,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:56,008 INFO L477 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 24 treesize of output 25 [2018-11-18 17:08:56,009 INFO L477 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-11-18 17:08:56,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:08:56,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:56,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:08:56,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-18 17:08:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 17:08:56,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:08:56,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 31 [2018-11-18 17:08:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 17:08:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 17:08:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-11-18 17:08:56,170 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 31 states. [2018-11-18 17:08:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:08:57,217 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-18 17:08:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 17:08:57,217 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-11-18 17:08:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:08:57,218 INFO L225 Difference]: With dead ends: 82 [2018-11-18 17:08:57,218 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 17:08:57,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 17:08:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 17:08:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-18 17:08:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 17:08:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-18 17:08:57,228 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2018-11-18 17:08:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:08:57,229 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-18 17:08:57,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 17:08:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-18 17:08:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 17:08:57,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:08:57,230 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:08:57,230 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:08:57,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:08:57,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1254881084, now seen corresponding path program 3 times [2018-11-18 17:08:57,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:08:57,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:08:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:57,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:08:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:08:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:08:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:08:57,297 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:08:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:08:57 BoogieIcfgContainer [2018-11-18 17:08:57,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:08:57,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:08:57,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:08:57,339 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:08:57,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:08:37" (3/4) ... [2018-11-18 17:08:57,342 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:08:57,396 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3199a585-0c71-4ad5-86c2-10874f03b69e/bin-2019/uautomizer/witness.graphml [2018-11-18 17:08:57,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:08:57,397 INFO L168 Benchmark]: Toolchain (without parser) took 20762.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 955.3 MB in the beginning and 861.2 MB in the end (delta: 94.2 MB). Peak memory consumption was 441.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,398 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:57,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,399 INFO L168 Benchmark]: Boogie Preprocessor took 31.23 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,399 INFO L168 Benchmark]: RCFGBuilder took 295.49 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: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,399 INFO L168 Benchmark]: TraceAbstraction took 20029.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 870.4 MB in the end (delta: 228.7 MB). Peak memory consumption was 419.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,400 INFO L168 Benchmark]: Witness Printer took 57.48 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 861.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:57,401 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.23 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.49 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: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20029.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 870.4 MB in the end (delta: 228.7 MB). Peak memory consumption was 419.5 MB. Max. memory is 11.5 GB. * Witness Printer took 57.48 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 861.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] mlist *head; VAL [\old(head)=16, \old(head)=18, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={13:14}] [L632] EXPR, FCALL malloc(sizeof(mlist)) [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] FCALL l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={13:14}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L634] COND TRUE head==((void *)0) [L635] FCALL l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={11:0}, l={13:14}, malloc(sizeof(mlist))={11:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={11:0}, k=2, l={13:14}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L646] insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={11:0}, insert_list(mylist,2)=0, mylist={13:14}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=0, \old(head)=11, \old(k)=5, head={11:0}, l={13:14}] [L632] EXPR, FCALL malloc(sizeof(mlist)) [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] FCALL l->key = k VAL [\old(head)=0, \old(head)=11, \old(k)=5, head={11:0}, k=5, l={12:0}, l={13:14}, malloc(sizeof(mlist))={12:0}] [L634] COND FALSE !(head==((void *)0)) [L637] FCALL l->key = k [L638] FCALL l->next = head VAL [\old(head)=0, \old(head)=11, \old(k)=5, head={11:0}, k=5, l={13:14}, l={12:0}, malloc(sizeof(mlist))={12:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=11, \old(k)=5, \result=0, head={12:0}, k=5, l={13:14}, l={12:0}, malloc(sizeof(mlist))={12:0}] [L647] insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={12:0}, insert_list(mylist,5)=0, mylist={13:14}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=0, \old(head)=12, \old(k)=1, head={12:0}, l={13:14}] [L632] EXPR, FCALL malloc(sizeof(mlist)) [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] FCALL l->key = k VAL [\old(head)=12, \old(head)=0, \old(k)=1, head={12:0}, k=1, l={9:0}, l={13:14}, malloc(sizeof(mlist))={9:0}] [L634] COND FALSE !(head==((void *)0)) [L637] FCALL l->key = k [L638] FCALL l->next = head VAL [\old(head)=0, \old(head)=12, \old(k)=1, head={12:0}, k=1, l={13:14}, l={9:0}, malloc(sizeof(mlist))={9:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=12, \old(head)=0, \old(k)=1, \result=0, head={9:0}, k=1, l={9:0}, l={13:14}, malloc(sizeof(mlist))={9:0}] [L648] insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={9:0}, insert_list(mylist,1)=0, mylist={13:14}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=9, \old(head)=0, \old(k)=3, head={9:0}, l={13:14}] [L632] EXPR, FCALL malloc(sizeof(mlist)) [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] FCALL l->key = k VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={15:0}, l={13:14}, malloc(sizeof(mlist))={15:0}] [L634] COND FALSE !(head==((void *)0)) [L637] FCALL l->key = k [L638] FCALL l->next = head VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={13:14}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=9, \old(k)=3, \result=0, head={15:0}, k=3, l={15:0}, l={13:14}, malloc(sizeof(mlist))={15:0}] [L649] insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,3)=0, mylist={13:14}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, l={15:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, k=2, l={15:0}, l={15:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR, FCALL l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, k=2, l={15:0}, l={15:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR, FCALL l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, k=2, l={9:0}, l={15:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR, FCALL l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, k=2, l={12:0}, l={15:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR, FCALL l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={15:0}, k=2, l={11:0}, l={15:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] RET return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={11:0}, head={15:0}, k=2, l={11:0}, l={15:0}] [L650] EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={15:0}, mylist={13:14}, search_list(head,2)={11:0}] [L650] temp = search_list(head,2) [L651] EXPR, FCALL temp->key VAL [\old(head)=0, \old(head)=0, head={15:0}, mylist={13:14}, temp={11:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={15:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={15:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. UNSAFE Result, 19.9s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 495 SDslu, 1008 SDs, 0 SdLazy, 2716 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 183 SyntacticMatches, 11 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=5, 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, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 504 ConstructedInterpolants, 9 QuantifiedInterpolants, 419071 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1296 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 220/356 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...