./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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 e5083763cd1026dac92f37bc5a05779baf01a71b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 12:41:25,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:41:25,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:41:25,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:41:25,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:41:25,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:41:25,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:41:25,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:41:25,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:41:25,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:41:25,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:41:25,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:41:25,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:41:25,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:41:25,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:41:25,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:41:25,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:41:25,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:41:25,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:41:25,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:41:25,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:41:25,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:41:25,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:41:25,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:41:25,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:41:25,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:41:25,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:41:25,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:41:25,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:41:25,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:41:25,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:41:25,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:41:25,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:41:25,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:41:25,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:41:25,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:41:25,037 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:41:25,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:41:25,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:41:25,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:41:25,047 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:41:25,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:41:25,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:41:25,048 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:41:25,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:41:25,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:41:25,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:41:25,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:41:25,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:41:25,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:41:25,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:41:25,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:41:25,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:41:25,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:41:25,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:41:25,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:41:25,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:41:25,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:41:25,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:41:25,051 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_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2018-11-10 12:41:25,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:41:25,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:41:25,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:41:25,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:41:25,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:41:25,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:41:25,129 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/data/b621dd1a3/087a477165e34bc4832f21365704eea5/FLAG9fb9eb96a [2018-11-10 12:41:25,489 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:41:25,489 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:41:25,495 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/data/b621dd1a3/087a477165e34bc4832f21365704eea5/FLAG9fb9eb96a [2018-11-10 12:41:25,504 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/data/b621dd1a3/087a477165e34bc4832f21365704eea5 [2018-11-10 12:41:25,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:41:25,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:41:25,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:41:25,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:41:25,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:41:25,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ceee7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25, skipping insertion in model container [2018-11-10 12:41:25,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:41:25,544 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:41:25,720 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:41:25,727 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:41:25,758 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:41:25,788 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:41:25,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25 WrapperNode [2018-11-10 12:41:25,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:41:25,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:41:25,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:41:25,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:41:25,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... [2018-11-10 12:41:25,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:41:25,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:41:25,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:41:25,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:41:25,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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-10 12:41:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:41:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:41:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:41:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 12:41:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 12:41:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 12:41:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 12:41:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 12:41:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 12:41:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 12:41:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 12:41:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 12:41:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 12:41:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 12:41:25,936 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 12:41:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:41:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:41:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:41:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:41:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:41:26,366 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:41:26,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:26 BoogieIcfgContainer [2018-11-10 12:41:26,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:41:26,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:41:26,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:41:26,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:41:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:41:25" (1/3) ... [2018-11-10 12:41:26,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc39db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:41:26, skipping insertion in model container [2018-11-10 12:41:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:25" (2/3) ... [2018-11-10 12:41:26,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc39db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:41:26, skipping insertion in model container [2018-11-10 12:41:26,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:26" (3/3) ... [2018-11-10 12:41:26,371 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:41:26,377 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:41:26,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-10 12:41:26,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-10 12:41:26,411 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:41:26,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:41:26,412 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:41:26,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:41:26,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:41:26,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:41:26,412 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:41:26,412 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:41:26,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:41:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-11-10 12:41:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:41:26,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:26,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:26,433 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:26,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 881407158, now seen corresponding path program 1 times [2018-11-10 12:41:26,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:26,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:41:26,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:41:26,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:41:26,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:41:26,539 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 2 states. [2018-11-10 12:41:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:26,557 INFO L93 Difference]: Finished difference Result 260 states and 370 transitions. [2018-11-10 12:41:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:41:26,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-10 12:41:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:26,566 INFO L225 Difference]: With dead ends: 260 [2018-11-10 12:41:26,566 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 12:41:26,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:41:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 12:41:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-10 12:41:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 12:41:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2018-11-10 12:41:26,598 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 14 [2018-11-10 12:41:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:26,599 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2018-11-10 12:41:26,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:41:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2018-11-10 12:41:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:41:26,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:26,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:26,600 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:26,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1267288291, now seen corresponding path program 1 times [2018-11-10 12:41:26,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:26,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:41:26,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:41:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:41:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:41:26,660 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 4 states. [2018-11-10 12:41:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:26,743 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-10 12:41:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:41:26,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-10 12:41:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:26,745 INFO L225 Difference]: With dead ends: 125 [2018-11-10 12:41:26,745 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 12:41:26,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:41:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 12:41:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 12:41:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 12:41:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-10 12:41:26,756 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 16 [2018-11-10 12:41:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:26,756 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-10 12:41:26,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:41:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-10 12:41:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:41:26,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:26,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:26,758 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:26,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1613321334, now seen corresponding path program 1 times [2018-11-10 12:41:26,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:26,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:26,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:41:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:41:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:26,785 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 3 states. [2018-11-10 12:41:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:26,825 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-11-10 12:41:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:41:26,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:41:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:26,827 INFO L225 Difference]: With dead ends: 251 [2018-11-10 12:41:26,827 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 12:41:26,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 12:41:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-11-10 12:41:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 12:41:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-11-10 12:41:26,836 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 24 [2018-11-10 12:41:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:26,837 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-11-10 12:41:26,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:41:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-10 12:41:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:41:26,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:26,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:26,838 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:26,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1198382796, now seen corresponding path program 1 times [2018-11-10 12:41:26,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:26,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:26,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:41:26,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:41:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:41:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:41:26,914 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 6 states. [2018-11-10 12:41:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:27,074 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-11-10 12:41:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:41:27,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-10 12:41:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:27,075 INFO L225 Difference]: With dead ends: 146 [2018-11-10 12:41:27,075 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 12:41:27,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:41:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 12:41:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2018-11-10 12:41:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 12:41:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-10 12:41:27,083 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 27 [2018-11-10 12:41:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:27,083 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-10 12:41:27,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:41:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-10 12:41:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:41:27,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:27,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:27,084 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:27,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 202776756, now seen corresponding path program 1 times [2018-11-10 12:41:27,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:27,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:41:27,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:41:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:41:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:41:27,150 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 6 states. [2018-11-10 12:41:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:27,240 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-11-10 12:41:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:41:27,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-10 12:41:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:27,241 INFO L225 Difference]: With dead ends: 149 [2018-11-10 12:41:27,241 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 12:41:27,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:41:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 12:41:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-10 12:41:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-10 12:41:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-11-10 12:41:27,248 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 29 [2018-11-10 12:41:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:27,249 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-11-10 12:41:27,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:41:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-10 12:41:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 12:41:27,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:27,250 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:27,250 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:27,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1586814352, now seen corresponding path program 1 times [2018-11-10 12:41:27,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:27,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:27,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:27,393 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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-10 12:41:27,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:27,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:27,448 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-10 12:41:27,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:27,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:27,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:27,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:41:27,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-11-10 12:41:27,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:27,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:41:27,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,489 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-10 12:41:27,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-11-10 12:41:27,548 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 12:41:27,550 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 12 treesize of output 11 [2018-11-10 12:41:27,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:27,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-10 12:41:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-10 12:41:27,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:41:27,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:27,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:27,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-10 12:41:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:27,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-11-10 12:41:27,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:41:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:41:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:41:27,652 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 15 states. [2018-11-10 12:41:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:28,027 INFO L93 Difference]: Finished difference Result 218 states and 231 transitions. [2018-11-10 12:41:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:41:28,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-10 12:41:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:28,030 INFO L225 Difference]: With dead ends: 218 [2018-11-10 12:41:28,030 INFO L226 Difference]: Without dead ends: 216 [2018-11-10 12:41:28,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-11-10 12:41:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-10 12:41:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 143. [2018-11-10 12:41:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 12:41:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-10 12:41:28,040 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 41 [2018-11-10 12:41:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:28,041 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-10 12:41:28,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:41:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-10 12:41:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:41:28,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:28,042 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:28,042 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:28,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1125116089, now seen corresponding path program 1 times [2018-11-10 12:41:28,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:28,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:28,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:41:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:41:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:28,082 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 3 states. [2018-11-10 12:41:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:28,128 INFO L93 Difference]: Finished difference Result 284 states and 309 transitions. [2018-11-10 12:41:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:41:28,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 12:41:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:28,130 INFO L225 Difference]: With dead ends: 284 [2018-11-10 12:41:28,130 INFO L226 Difference]: Without dead ends: 181 [2018-11-10 12:41:28,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-10 12:41:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2018-11-10 12:41:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 12:41:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2018-11-10 12:41:28,160 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 42 [2018-11-10 12:41:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:28,160 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2018-11-10 12:41:28,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:41:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-11-10 12:41:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 12:41:28,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:28,162 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:28,162 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:28,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1861351858, now seen corresponding path program 1 times [2018-11-10 12:41:28,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:28,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:28,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:28,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:41:28,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:28,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:28,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:41:28,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:41:28,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:28,199 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 3 states. [2018-11-10 12:41:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:28,209 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-11-10 12:41:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:41:28,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-10 12:41:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:28,211 INFO L225 Difference]: With dead ends: 168 [2018-11-10 12:41:28,211 INFO L226 Difference]: Without dead ends: 166 [2018-11-10 12:41:28,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-10 12:41:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-11-10 12:41:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 12:41:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-11-10 12:41:28,218 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 53 [2018-11-10 12:41:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:28,218 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-11-10 12:41:28,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:41:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-11-10 12:41:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:41:28,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:28,219 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:28,220 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2054445301, now seen corresponding path program 1 times [2018-11-10 12:41:28,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:28,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:28,631 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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-10 12:41:28,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:28,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:28,663 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-10 12:41:28,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:28,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:28,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:28,729 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-10 12:41:28,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-10 12:41:28,750 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-10 12:41:28,751 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 8 treesize of output 7 [2018-11-10 12:41:28,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,759 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-10 12:41:28,761 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-10 12:41:28,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,768 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-10 12:41:28,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-11-10 12:41:28,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:28,831 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 27 treesize of output 28 [2018-11-10 12:41:28,833 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 11 [2018-11-10 12:41:28,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,855 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 37 treesize of output 42 [2018-11-10 12:41:28,858 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 12 treesize of output 15 [2018-11-10 12:41:28,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2018-11-10 12:41:28,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-10 12:41:28,905 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 18 treesize of output 17 [2018-11-10 12:41:28,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:63 [2018-11-10 12:41:28,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-11-10 12:41:28,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 12:41:28,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-10 12:41:28,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 12:41:28,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-10 12:41:28,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 12:41:28,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:28,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:29,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:29,003 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:13 [2018-11-10 12:41:29,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:41:29,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:41:29,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:29,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:29,047 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-10 12:41:29,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 12:41:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:29,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-11-10 12:41:29,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 12:41:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 12:41:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-11-10 12:41:29,088 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 31 states. [2018-11-10 12:41:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:30,396 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-11-10 12:41:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 12:41:30,396 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-11-10 12:41:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:30,397 INFO L225 Difference]: With dead ends: 219 [2018-11-10 12:41:30,397 INFO L226 Difference]: Without dead ends: 217 [2018-11-10 12:41:30,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=470, Invalid=2392, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 12:41:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-10 12:41:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2018-11-10 12:41:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 12:41:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-11-10 12:41:30,405 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 55 [2018-11-10 12:41:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:30,405 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-11-10 12:41:30,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 12:41:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-11-10 12:41:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 12:41:30,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:30,407 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:30,407 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:30,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash 176988780, now seen corresponding path program 1 times [2018-11-10 12:41:30,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:30,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:30,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:30,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:30,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 12:41:30,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:30,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:30,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:41:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:41:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:30,435 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 3 states. [2018-11-10 12:41:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:30,455 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-11-10 12:41:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:41:30,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-10 12:41:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:30,456 INFO L225 Difference]: With dead ends: 347 [2018-11-10 12:41:30,456 INFO L226 Difference]: Without dead ends: 221 [2018-11-10 12:41:30,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-10 12:41:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2018-11-10 12:41:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 12:41:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 213 transitions. [2018-11-10 12:41:30,463 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 213 transitions. Word has length 59 [2018-11-10 12:41:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:30,463 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 213 transitions. [2018-11-10 12:41:30,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:41:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 213 transitions. [2018-11-10 12:41:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 12:41:30,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:30,463 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:30,464 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:30,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -31561667, now seen corresponding path program 1 times [2018-11-10 12:41:30,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:30,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:30,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:30,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:30,676 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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-10 12:41:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:30,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:30,703 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-10 12:41:30,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:30,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:41:30,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-11-10 12:41:30,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:30,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:41:30,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,768 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-10 12:41:30,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-11-10 12:41:30,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,827 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 44 treesize of output 45 [2018-11-10 12:41:30,830 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-10 12:41:30,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-11-10 12:41:30,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:30,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-10 12:41:30,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-11-10 12:41:30,900 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 42 treesize of output 41 [2018-11-10 12:41:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 12:41:30,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,915 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-10 12:41:30,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-11-10 12:41:30,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2018-11-10 12:41:30,981 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 16 treesize of output 15 [2018-11-10 12:41:30,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:30,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:30,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:60 [2018-11-10 12:41:31,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-11-10 12:41:31,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-10 12:41:31,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:31,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:31,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:31,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 12:41:31,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:31,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:31,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:31,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-11-10 12:41:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:31,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-11-10 12:41:31,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 12:41:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 12:41:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-11-10 12:41:31,092 INFO L87 Difference]: Start difference. First operand 201 states and 213 transitions. Second operand 27 states. [2018-11-10 12:41:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:32,896 INFO L93 Difference]: Finished difference Result 468 states and 497 transitions. [2018-11-10 12:41:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 12:41:32,896 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-11-10 12:41:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:32,897 INFO L225 Difference]: With dead ends: 468 [2018-11-10 12:41:32,897 INFO L226 Difference]: Without dead ends: 466 [2018-11-10 12:41:32,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=656, Invalid=2766, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 12:41:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-10 12:41:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 262. [2018-11-10 12:41:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-10 12:41:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions. [2018-11-10 12:41:32,907 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 60 [2018-11-10 12:41:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:32,907 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions. [2018-11-10 12:41:32,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 12:41:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions. [2018-11-10 12:41:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 12:41:32,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:32,908 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:32,909 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:32,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -278160506, now seen corresponding path program 1 times [2018-11-10 12:41:32,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:33,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:33,231 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/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-10 12:41:33,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:33,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:33,271 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-10 12:41:33,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:33,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,339 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 17 treesize of output 21 [2018-11-10 12:41:33,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-10 12:41:33,382 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-10 12:41:33,384 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 8 treesize of output 7 [2018-11-10 12:41:33,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,398 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-10 12:41:33,403 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-10 12:41:33,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,414 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-10 12:41:33,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 12:41:33,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,497 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 36 treesize of output 37 [2018-11-10 12:41:33,498 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 11 [2018-11-10 12:41:33,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,519 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 37 treesize of output 42 [2018-11-10 12:41:33,521 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 12 treesize of output 15 [2018-11-10 12:41:33,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-11-10 12:41:33,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-10 12:41:33,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:68 [2018-11-10 12:41:33,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:33,636 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 53 treesize of output 58 [2018-11-10 12:41:33,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-10 12:41:33,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-10 12:41:33,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-10 12:41:33,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:66 [2018-11-10 12:41:33,779 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2018-11-10 12:41:33,780 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 20 treesize of output 19 [2018-11-10 12:41:33,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-11-10 12:41:33,807 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 20 treesize of output 19 [2018-11-10 12:41:33,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,822 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-10 12:41:33,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:106 [2018-11-10 12:41:33,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 92 [2018-11-10 12:41:33,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59 [2018-11-10 12:41:33,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:33,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:33,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:120, output treesize:74 [2018-11-10 12:41:33,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 42 [2018-11-10 12:41:33,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:33,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:41:33,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:41:33,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:33,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-11-10 12:41:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2018-11-10 12:41:34,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 12:41:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 12:41:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 12:41:34,027 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 34 states. [2018-11-10 12:41:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:35,538 INFO L93 Difference]: Finished difference Result 315 states and 336 transitions. [2018-11-10 12:41:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 12:41:35,538 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-11-10 12:41:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:35,539 INFO L225 Difference]: With dead ends: 315 [2018-11-10 12:41:35,539 INFO L226 Difference]: Without dead ends: 313 [2018-11-10 12:41:35,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2018-11-10 12:41:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-10 12:41:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-11-10 12:41:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-10 12:41:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 309 transitions. [2018-11-10 12:41:35,551 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 309 transitions. Word has length 65 [2018-11-10 12:41:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:35,551 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 309 transitions. [2018-11-10 12:41:35,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 12:41:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 309 transitions. [2018-11-10 12:41:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 12:41:35,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:35,552 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:41:35,552 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:35,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 946464871, now seen corresponding path program 1 times [2018-11-10 12:41:35,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:35,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:35,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:35,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:41:35,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:35,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:41:35,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:41:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:41:35,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:41:35,584 INFO L87 Difference]: Start difference. First operand 289 states and 309 transitions. Second operand 4 states. [2018-11-10 12:41:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:35,611 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-11-10 12:41:35,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:41:35,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 12:41:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:35,612 INFO L225 Difference]: With dead ends: 322 [2018-11-10 12:41:35,612 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 12:41:35,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:41:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 12:41:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-11-10 12:41:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-10 12:41:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 325 transitions. [2018-11-10 12:41:35,620 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 325 transitions. Word has length 65 [2018-11-10 12:41:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:35,620 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 325 transitions. [2018-11-10 12:41:35,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:41:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 325 transitions. [2018-11-10 12:41:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 12:41:35,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:35,621 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:35,621 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:35,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 480279338, now seen corresponding path program 1 times [2018-11-10 12:41:35,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:35,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:35,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:35,849 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:35,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:35,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:35,873 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-10 12:41:35,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:35,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:35,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:35,882 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-10 12:41:35,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-10 12:41:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:35,903 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-10 12:41:35,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:35,913 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 8 treesize of output 7 [2018-11-10 12:41:35,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,919 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-10 12:41:35,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-11-10 12:41:35,968 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 54 treesize of output 55 [2018-11-10 12:41:35,969 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 16 treesize of output 15 [2018-11-10 12:41:35,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,981 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-10 12:41:35,982 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 16 treesize of output 15 [2018-11-10 12:41:35,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:35,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2018-11-10 12:41:36,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-11-10 12:41:36,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 12:41:36,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:36,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:41:36,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:36,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:36,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-10 12:41:36,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-10 12:41:36,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:36,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:41:36,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:36,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:36,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:36,109 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2018-11-10 12:41:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:36,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:36,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-11-10 12:41:36,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 12:41:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 12:41:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=531, Unknown=7, NotChecked=0, Total=600 [2018-11-10 12:41:36,157 INFO L87 Difference]: Start difference. First operand 305 states and 325 transitions. Second operand 25 states. [2018-11-10 12:41:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:37,004 INFO L93 Difference]: Finished difference Result 325 states and 345 transitions. [2018-11-10 12:41:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 12:41:37,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-11-10 12:41:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:37,006 INFO L225 Difference]: With dead ends: 325 [2018-11-10 12:41:37,007 INFO L226 Difference]: Without dead ends: 281 [2018-11-10 12:41:37,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1307, Unknown=10, NotChecked=0, Total=1560 [2018-11-10 12:41:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-10 12:41:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-10 12:41:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-10 12:41:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 300 transitions. [2018-11-10 12:41:37,017 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 300 transitions. Word has length 67 [2018-11-10 12:41:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:37,018 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 300 transitions. [2018-11-10 12:41:37,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 12:41:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 300 transitions. [2018-11-10 12:41:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:41:37,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:37,018 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-10 12:41:37,019 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:37,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1861891477, now seen corresponding path program 1 times [2018-11-10 12:41:37,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:37,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:37,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 12:41:37,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:37,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:37,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:41:37,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:41:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:37,052 INFO L87 Difference]: Start difference. First operand 281 states and 300 transitions. Second operand 3 states. [2018-11-10 12:41:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:37,078 INFO L93 Difference]: Finished difference Result 385 states and 413 transitions. [2018-11-10 12:41:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:41:37,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-10 12:41:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:37,079 INFO L225 Difference]: With dead ends: 385 [2018-11-10 12:41:37,079 INFO L226 Difference]: Without dead ends: 168 [2018-11-10 12:41:37,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:41:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-10 12:41:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2018-11-10 12:41:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 12:41:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-11-10 12:41:37,086 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 78 [2018-11-10 12:41:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:37,086 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-11-10 12:41:37,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:41:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-11-10 12:41:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:41:37,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:37,087 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:41:37,087 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:37,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash -69027919, now seen corresponding path program 1 times [2018-11-10 12:41:37,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:38,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:38,017 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:38,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:38,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:38,043 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-10 12:41:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:38,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,100 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 17 treesize of output 21 [2018-11-10 12:41:38,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-10 12:41:38,151 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-10 12:41:38,152 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-10 12:41:38,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,163 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-10 12:41:38,165 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 8 treesize of output 7 [2018-11-10 12:41:38,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,173 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-10 12:41:38,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 12:41:38,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,262 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 36 treesize of output 37 [2018-11-10 12:41:38,264 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 11 [2018-11-10 12:41:38,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,287 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 37 treesize of output 42 [2018-11-10 12:41:38,289 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 12 treesize of output 15 [2018-11-10 12:41:38,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-11-10 12:41:38,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-11-10 12:41:38,340 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 14 treesize of output 13 [2018-11-10 12:41:38,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:79 [2018-11-10 12:41:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,395 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-10 12:41:38,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:77 [2018-11-10 12:41:38,462 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 66 treesize of output 65 [2018-11-10 12:41:38,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-10 12:41:38,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-10 12:41:38,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-10 12:41:38,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:67 [2018-11-10 12:41:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:38,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 92 [2018-11-10 12:41:38,647 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-10 12:41:38,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,671 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 51 treesize of output 52 [2018-11-10 12:41:38,673 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-10 12:41:38,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:74 [2018-11-10 12:41:38,728 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 55 treesize of output 60 [2018-11-10 12:41:38,730 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 22 treesize of output 21 [2018-11-10 12:41:38,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:38,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:128 [2018-11-10 12:41:38,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 91 [2018-11-10 12:41:38,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:38,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-10 12:41:38,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2018-11-10 12:41:38,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:38,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:38,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 12:41:38,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-10 12:41:38,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:38,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,901 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:38,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:38,910 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:142, output treesize:26 [2018-11-10 12:41:39,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 12:41:39,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 12:41:39,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:39,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:41:39,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:39,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:39,027 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-10 12:41:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 43 [2018-11-10 12:41:39,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 12:41:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 12:41:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1682, Unknown=1, NotChecked=0, Total=1806 [2018-11-10 12:41:39,114 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 43 states. [2018-11-10 12:41:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:41,235 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2018-11-10 12:41:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 12:41:41,235 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 78 [2018-11-10 12:41:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:41,236 INFO L225 Difference]: With dead ends: 182 [2018-11-10 12:41:41,236 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 12:41:41,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=622, Invalid=4204, Unknown=4, NotChecked=0, Total=4830 [2018-11-10 12:41:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 12:41:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2018-11-10 12:41:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 12:41:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-10 12:41:41,246 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 78 [2018-11-10 12:41:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:41,246 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-10 12:41:41,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 12:41:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-10 12:41:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:41:41,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:41,247 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-10 12:41:41,247 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:41,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1491402952, now seen corresponding path program 1 times [2018-11-10 12:41:41,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:41,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:41,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:41,576 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:41,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:41,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:41,599 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-10 12:41:41,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:41:41,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:41:41,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-11-10 12:41:41,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:41,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:41:41,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,641 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-10 12:41:41,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-11-10 12:41:41,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,694 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 44 treesize of output 45 [2018-11-10 12:41:41,696 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-10 12:41:41,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-11-10 12:41:41,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-10 12:41:41,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:61 [2018-11-10 12:41:41,791 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 51 treesize of output 50 [2018-11-10 12:41:41,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 12:41:41,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,812 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-10 12:41:41,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:66 [2018-11-10 12:41:41,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:41,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 89 [2018-11-10 12:41:41,918 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-10 12:41:41,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:41,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:41,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:85 [2018-11-10 12:41:42,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:42,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:42,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:42,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:42,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-10 12:41:42,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:42,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2018-11-10 12:41:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:42,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-11-10 12:41:42,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 12:41:42,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:42,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:84 [2018-11-10 12:41:42,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 98 [2018-11-10 12:41:42,155 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 20 treesize of output 19 [2018-11-10 12:41:42,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:42,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:140, output treesize:124 [2018-11-10 12:41:42,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-11-10 12:41:42,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-10 12:41:42,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-10 12:41:42,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:42,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 12:41:42,261 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:42,264 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-11-10 12:41:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:42,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2018-11-10 12:41:42,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 12:41:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 12:41:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 12:41:42,316 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 37 states. [2018-11-10 12:41:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:43,565 INFO L93 Difference]: Finished difference Result 228 states and 235 transitions. [2018-11-10 12:41:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 12:41:43,566 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2018-11-10 12:41:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:43,566 INFO L225 Difference]: With dead ends: 228 [2018-11-10 12:41:43,566 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 12:41:43,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=627, Invalid=3663, Unknown=0, NotChecked=0, Total=4290 [2018-11-10 12:41:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 12:41:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 149. [2018-11-10 12:41:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-10 12:41:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-10 12:41:43,573 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 80 [2018-11-10 12:41:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:43,574 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-10 12:41:43,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 12:41:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-10 12:41:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 12:41:43,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:43,575 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:43,575 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:43,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 721209582, now seen corresponding path program 1 times [2018-11-10 12:41:43,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:43,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:44,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:44,135 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:44,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:44,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:44,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-10 12:41:44,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:41:44,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,223 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 17 treesize of output 21 [2018-11-10 12:41:44,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-10 12:41:44,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:44,239 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-10 12:41:44,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:44,252 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 8 treesize of output 7 [2018-11-10 12:41:44,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,262 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-10 12:41:44,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-10 12:41:44,286 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 19 treesize of output 24 [2018-11-10 12:41:44,289 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 12 treesize of output 11 [2018-11-10 12:41:44,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,308 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 30 treesize of output 31 [2018-11-10 12:41:44,310 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-10 12:41:44,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-11-10 12:41:44,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-10 12:41:44,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:77 [2018-11-10 12:41:44,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-11-10 12:41:44,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-10 12:41:44,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-10 12:41:44,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 12:41:44,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:71 [2018-11-10 12:41:44,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 97 [2018-11-10 12:41:44,660 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-10 12:41:44,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,688 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 19 treesize of output 28 [2018-11-10 12:41:44,689 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 16 treesize of output 15 [2018-11-10 12:41:44,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:106 [2018-11-10 12:41:44,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-10 12:41:44,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:103 [2018-11-10 12:41:44,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:44,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 103 [2018-11-10 12:41:44,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 12:41:44,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:41:44,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 52 [2018-11-10 12:41:44,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-10 12:41:44,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:44,904 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-10 12:41:44,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:122, output treesize:105 [2018-11-10 12:41:45,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 169 [2018-11-10 12:41:45,049 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 58 treesize of output 56 [2018-11-10 12:41:45,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 138 [2018-11-10 12:41:45,083 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 32 treesize of output 31 [2018-11-10 12:41:45,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,101 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-10 12:41:45,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:220, output treesize:168 [2018-11-10 12:41:45,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 96 [2018-11-10 12:41:45,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 12:41:45,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:41:45,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-10 12:41:45,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:45,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:187, output treesize:102 [2018-11-10 12:41:45,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:45,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2018-11-10 12:41:45,357 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-10 12:41:45,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:41:45,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:41:45,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:45,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:45,377 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:103, output treesize:4 [2018-11-10 12:41:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:45,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 40 [2018-11-10 12:41:45,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-10 12:41:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 12:41:45,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1390, Unknown=8, NotChecked=0, Total=1560 [2018-11-10 12:41:45,433 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 40 states. [2018-11-10 12:41:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:47,982 INFO L93 Difference]: Finished difference Result 312 states and 322 transitions. [2018-11-10 12:41:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 12:41:47,982 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-10 12:41:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:47,983 INFO L225 Difference]: With dead ends: 312 [2018-11-10 12:41:47,983 INFO L226 Difference]: Without dead ends: 310 [2018-11-10 12:41:47,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=675, Invalid=4715, Unknown=12, NotChecked=0, Total=5402 [2018-11-10 12:41:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-10 12:41:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 204. [2018-11-10 12:41:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 12:41:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 210 transitions. [2018-11-10 12:41:47,992 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 210 transitions. Word has length 85 [2018-11-10 12:41:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:47,992 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 210 transitions. [2018-11-10 12:41:47,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-10 12:41:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 210 transitions. [2018-11-10 12:41:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 12:41:47,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:47,993 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:41:47,993 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:47,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1712452573, now seen corresponding path program 1 times [2018-11-10 12:41:47,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:47,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:47,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:47,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:47,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 12:41:48,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:48,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:41:48,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:41:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:41:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:41:48,041 INFO L87 Difference]: Start difference. First operand 204 states and 210 transitions. Second operand 4 states. [2018-11-10 12:41:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:48,083 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-11-10 12:41:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:41:48,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-10 12:41:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:48,085 INFO L225 Difference]: With dead ends: 234 [2018-11-10 12:41:48,085 INFO L226 Difference]: Without dead ends: 219 [2018-11-10 12:41:48,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:41:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-10 12:41:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-10 12:41:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 12:41:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 223 transitions. [2018-11-10 12:41:48,095 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 223 transitions. Word has length 88 [2018-11-10 12:41:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:48,095 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 223 transitions. [2018-11-10 12:41:48,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:41:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 223 transitions. [2018-11-10 12:41:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:41:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:48,096 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:48,097 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash 766156774, now seen corresponding path program 1 times [2018-11-10 12:41:48,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:48,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:48,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:48,815 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:48,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:48,841 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-10 12:41:48,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:41:48,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:48,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:48,858 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 17 treesize of output 21 [2018-11-10 12:41:48,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-10 12:41:48,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:48,893 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-10 12:41:48,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:48,905 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 8 treesize of output 7 [2018-11-10 12:41:48,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:48,913 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-10 12:41:48,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-10 12:41:49,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,009 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 26 treesize of output 31 [2018-11-10 12:41:49,015 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 12 treesize of output 15 [2018-11-10 12:41:49,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,037 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 51 treesize of output 52 [2018-11-10 12:41:49,042 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 11 [2018-11-10 12:41:49,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-11-10 12:41:49,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,103 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-10 12:41:49,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:70 [2018-11-10 12:41:49,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,171 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 53 treesize of output 61 [2018-11-10 12:41:49,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-11-10 12:41:49,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:41:49,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-11-10 12:41:49,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-10 12:41:49,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,218 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-10 12:41:49,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:68 [2018-11-10 12:41:49,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 117 [2018-11-10 12:41:49,338 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 19 [2018-11-10 12:41:49,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 132 [2018-11-10 12:41:49,371 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 19 [2018-11-10 12:41:49,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:118 [2018-11-10 12:41:49,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 34 [2018-11-10 12:41:49,440 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 34 treesize of output 33 [2018-11-10 12:41:49,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:173, output treesize:157 [2018-11-10 12:41:49,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:49,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 146 [2018-11-10 12:41:49,715 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 65 [2018-11-10 12:41:49,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:41:49,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-10 12:41:49,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2018-11-10 12:41:49,757 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:49,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:49,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-11-10 12:41:49,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 12:41:49,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-11-10 12:41:49,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:49,818 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,821 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,827 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-10 12:41:49,827 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:156, output treesize:13 [2018-11-10 12:41:49,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 12:41:49,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:41:49,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 12:41:49,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:49,881 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-10 12:41:49,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-11-10 12:41:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:49,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 45 [2018-11-10 12:41:49,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 12:41:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 12:41:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1833, Unknown=2, NotChecked=0, Total=1980 [2018-11-10 12:41:49,955 INFO L87 Difference]: Start difference. First operand 217 states and 223 transitions. Second operand 45 states. [2018-11-10 12:41:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:52,029 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2018-11-10 12:41:52,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 12:41:52,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2018-11-10 12:41:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:52,030 INFO L225 Difference]: With dead ends: 236 [2018-11-10 12:41:52,030 INFO L226 Difference]: Without dead ends: 234 [2018-11-10 12:41:52,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=600, Invalid=4800, Unknown=2, NotChecked=0, Total=5402 [2018-11-10 12:41:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-10 12:41:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-11-10 12:41:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-10 12:41:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 235 transitions. [2018-11-10 12:41:52,041 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 235 transitions. Word has length 90 [2018-11-10 12:41:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:52,041 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 235 transitions. [2018-11-10 12:41:52,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 12:41:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 235 transitions. [2018-11-10 12:41:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 12:41:52,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:52,042 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:52,042 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:52,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash 284755828, now seen corresponding path program 1 times [2018-11-10 12:41:52,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:52,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:52,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:52,711 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:52,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:52,738 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-10 12:41:52,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:41:52,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,749 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 17 treesize of output 21 [2018-11-10 12:41:52,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-10 12:41:52,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:52,763 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 8 treesize of output 7 [2018-11-10 12:41:52,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:52,775 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-10 12:41:52,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,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-10 12:41:52,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-10 12:41:52,803 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 19 treesize of output 24 [2018-11-10 12:41:52,805 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 12 treesize of output 11 [2018-11-10 12:41:52,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,822 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 30 treesize of output 31 [2018-11-10 12:41:52,824 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-10 12:41:52,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-11-10 12:41:52,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 38 [2018-11-10 12:41:52,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:73 [2018-11-10 12:41:52,936 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:41:52,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 12:41:52,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 12:41:52,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:52,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-11-10 12:41:52,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 12:41:52,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:52,990 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-10 12:41:52,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:71 [2018-11-10 12:41:53,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 111 [2018-11-10 12:41:53,112 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 15 [2018-11-10 12:41:53,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 81 [2018-11-10 12:41:53,146 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 16 treesize of output 23 [2018-11-10 12:41:53,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:129 [2018-11-10 12:41:53,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-10 12:41:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:141, output treesize:133 [2018-11-10 12:41:53,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 157 [2018-11-10 12:41:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 70 [2018-11-10 12:41:53,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:41:53,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 126 [2018-11-10 12:41:53,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-11-10 12:41:53,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,355 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-10 12:41:53,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:152, output treesize:143 [2018-11-10 12:41:53,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,499 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 284 [2018-11-10 12:41:53,510 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 86 treesize of output 84 [2018-11-10 12:41:53,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 284 [2018-11-10 12:41:53,552 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 48 treesize of output 47 [2018-11-10 12:41:53,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:53,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:295, output treesize:215 [2018-11-10 12:41:53,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:53,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 223 [2018-11-10 12:41:53,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 118 [2018-11-10 12:41:53,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 12:41:54,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-10 12:41:54,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-10 12:41:54,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:54,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:70 [2018-11-10 12:41:54,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:41:54,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 105 [2018-11-10 12:41:54,107 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 87 [2018-11-10 12:41:54,107 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:41:54,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-10 12:41:54,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:41:54,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:41:54,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:54,141 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-10 12:41:54,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:71, output treesize:4 [2018-11-10 12:41:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-11-10 12:41:54,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-10 12:41:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 12:41:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 12:41:54,200 INFO L87 Difference]: Start difference. First operand 229 states and 235 transitions. Second operand 46 states. [2018-11-10 12:41:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:56,861 INFO L93 Difference]: Finished difference Result 281 states and 288 transitions. [2018-11-10 12:41:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 12:41:56,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-11-10 12:41:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:41:56,862 INFO L225 Difference]: With dead ends: 281 [2018-11-10 12:41:56,862 INFO L226 Difference]: Without dead ends: 279 [2018-11-10 12:41:56,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=608, Invalid=5092, Unknown=0, NotChecked=0, Total=5700 [2018-11-10 12:41:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-10 12:41:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 252. [2018-11-10 12:41:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-10 12:41:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 258 transitions. [2018-11-10 12:41:56,880 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 258 transitions. Word has length 91 [2018-11-10 12:41:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:41:56,880 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 258 transitions. [2018-11-10 12:41:56,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-10 12:41:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 258 transitions. [2018-11-10 12:41:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 12:41:56,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:41:56,881 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:56,881 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:41:56,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1341878078, now seen corresponding path program 1 times [2018-11-10 12:41:56,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:56,926 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:41:56,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:41:56 BoogieIcfgContainer [2018-11-10 12:41:56,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:41:56,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:41:56,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:41:56,970 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:41:56,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:26" (3/4) ... [2018-11-10 12:41:56,975 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:41:57,017 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb1a7301-6ca7-474f-aaaf-1f1b551b6963/bin-2019/uautomizer/witness.graphml [2018-11-10 12:41:57,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:41:57,017 INFO L168 Benchmark]: Toolchain (without parser) took 31511.56 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 628.1 MB). Free memory was 955.5 MB in the beginning and 1.3 GB in the end (delta: -298.8 MB). Peak memory consumption was 329.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,018 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:41:57,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,019 INFO L168 Benchmark]: Boogie Preprocessor took 91.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,019 INFO L168 Benchmark]: RCFGBuilder took 485.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,019 INFO L168 Benchmark]: TraceAbstraction took 30602.81 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 485.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.2 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,019 INFO L168 Benchmark]: Witness Printer took 46.98 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:57,020 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 485.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30602.81 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 485.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.2 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.98 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L986] FCALL head->next = ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L987] FCALL head->data = 0 VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L988] SLL* item = head; [L989] int status = 0; VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={12:0}, item->next={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L997] COND TRUE !status VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L999] FCALL item->data = 1 VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L1000] status = 1 VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1013] COND FALSE !(0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1014] COND FALSE !(0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={14:0}, item->next={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L997] COND FALSE !(!status) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1002] COND TRUE status == 1 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1004] FCALL item->data = 2 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1005] status = 2 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1013] COND FALSE !(0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1014] COND FALSE !(0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={10:0}, item->next={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L997] COND FALSE !(!status) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1007] COND TRUE status >= 2 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1009] FCALL item->data = 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1010] status = 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1013] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1014] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1017] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1031] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1032] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1032] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1033] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1034] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next->next->data VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, head->next->next->next->data=3, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 14 error locations. UNSAFE Result, 30.5s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 8898 SDslu, 20500 SDs, 0 SdLazy, 12428 SolverSat, 1010 SolverUnsat, 132 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 589 SyntacticMatches, 43 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=13, 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 682 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2017 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1888 ConstructedInterpolants, 214 QuantifiedInterpolants, 5445124 SizeOfPredicates, 181 NumberOfNonLiveVariables, 1636 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 132/672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...