./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-635dfa2 [2018-12-03 00:05:54,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:05:54,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:05:54,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:05:54,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:05:54,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:05:54,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:05:54,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:05:54,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:05:54,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:05:54,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:05:54,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:05:54,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:05:54,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:05:54,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:05:54,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:05:54,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:05:54,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:05:54,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:05:54,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:05:54,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:05:54,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:05:54,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:05:54,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:05:54,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:05:54,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:05:54,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:05:54,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:05:54,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:05:54,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:05:54,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:05:54,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:05:54,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:05:54,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:05:54,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:05:54,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:05:54,806 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-03 00:05:54,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:05:54,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:05:54,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:05:54,814 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:05:54,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 00:05:54,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 00:05:54,814 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 00:05:54,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 00:05:54,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 00:05:54,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:05:54,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:05:54,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:05:54,816 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_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:05:54,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:05:54,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:05:54,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:05:54,842 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:05:54,843 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:05:54,843 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-12-03 00:05:54,881 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/data/be33b4486/d862ea6369e74aa3b252e63badeb7fe9/FLAG520d5828b [2018-12-03 00:05:55,309 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:05:55,309 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-12-03 00:05:55,315 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/data/be33b4486/d862ea6369e74aa3b252e63badeb7fe9/FLAG520d5828b [2018-12-03 00:05:55,323 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/data/be33b4486/d862ea6369e74aa3b252e63badeb7fe9 [2018-12-03 00:05:55,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:05:55,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:05:55,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:05:55,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:05:55,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:05:55,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55, skipping insertion in model container [2018-12-03 00:05:55,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:05:55,357 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:05:55,523 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:05:55,560 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:05:55,586 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:05:55,606 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:05:55,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55 WrapperNode [2018-12-03 00:05:55,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:05:55,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:05:55,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:05:55,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:05:55,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:05:55,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:05:55,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:05:55,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:05:55,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... [2018-12-03 00:05:55,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:05:55,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:05:55,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:05:55,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:05:55,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 00:05:55,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 00:05:55,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 00:05:55,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:05:55,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:05:55,908 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:05:55,909 INFO L280 CfgBuilder]: Removed 31 assue(true) statements. [2018-12-03 00:05:55,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:05:55 BoogieIcfgContainer [2018-12-03 00:05:55,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:05:55,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:05:55,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:05:55,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:05:55,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:05:55" (1/3) ... [2018-12-03 00:05:55,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4521b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:05:55, skipping insertion in model container [2018-12-03 00:05:55,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:05:55" (2/3) ... [2018-12-03 00:05:55,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4521b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:05:55, skipping insertion in model container [2018-12-03 00:05:55,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:05:55" (3/3) ... [2018-12-03 00:05:55,914 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-12-03 00:05:55,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:05:55,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 00:05:55,933 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 00:05:55,951 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 00:05:55,952 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:05:55,952 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 00:05:55,952 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:05:55,952 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:05:55,952 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:05:55,952 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:05:55,952 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:05:55,952 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:05:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-12-03 00:05:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 00:05:55,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:55,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:55,969 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:55,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash 786723767, now seen corresponding path program 1 times [2018-12-03 00:05:55,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:05:56,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 00:05:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 00:05:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 00:05:56,061 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-12-03 00:05:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,077 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2018-12-03 00:05:56,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 00:05:56,078 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-03 00:05:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,084 INFO L225 Difference]: With dead ends: 174 [2018-12-03 00:05:56,084 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 00:05:56,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 00:05:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 00:05:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 00:05:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 00:05:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-12-03 00:05:56,109 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2018-12-03 00:05:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,109 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-12-03 00:05:56,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 00:05:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-12-03 00:05:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 00:05:56,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,110 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1383122703, now seen corresponding path program 1 times [2018-12-03 00:05:56,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,147 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2018-12-03 00:05:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,174 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-12-03 00:05:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 00:05:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,175 INFO L225 Difference]: With dead ends: 84 [2018-12-03 00:05:56,175 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 00:05:56,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 00:05:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 00:05:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 00:05:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-12-03 00:05:56,179 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2018-12-03 00:05:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,179 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-12-03 00:05:56,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-12-03 00:05:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 00:05:56,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1313288485, now seen corresponding path program 1 times [2018-12-03 00:05:56,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,204 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2018-12-03 00:05:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,225 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-12-03 00:05:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 00:05:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,227 INFO L225 Difference]: With dead ends: 74 [2018-12-03 00:05:56,227 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 00:05:56,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 00:05:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 00:05:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 00:05:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-12-03 00:05:56,233 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2018-12-03 00:05:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,233 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-12-03 00:05:56,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-12-03 00:05:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 00:05:56,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,234 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -577581690, now seen corresponding path program 1 times [2018-12-03 00:05:56,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,260 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2018-12-03 00:05:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,284 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-12-03 00:05:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 00:05:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,285 INFO L225 Difference]: With dead ends: 157 [2018-12-03 00:05:56,285 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 00:05:56,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 00:05:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-12-03 00:05:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 00:05:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-12-03 00:05:56,290 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2018-12-03 00:05:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,291 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-12-03 00:05:56,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-12-03 00:05:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 00:05:56,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,291 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1346327205, now seen corresponding path program 1 times [2018-12-03 00:05:56,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,312 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-12-03 00:05:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,318 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-12-03 00:05:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-03 00:05:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,319 INFO L225 Difference]: With dead ends: 83 [2018-12-03 00:05:56,319 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 00:05:56,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 00:05:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 00:05:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 00:05:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-12-03 00:05:56,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2018-12-03 00:05:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,323 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-12-03 00:05:56,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-12-03 00:05:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 00:05:56,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,324 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1346325283, now seen corresponding path program 1 times [2018-12-03 00:05:56,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:05:56,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:05:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:05:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:05:56,345 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2018-12-03 00:05:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,385 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-12-03 00:05:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:05:56,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-03 00:05:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,385 INFO L225 Difference]: With dead ends: 101 [2018-12-03 00:05:56,385 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 00:05:56,386 INFO L631 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-12-03 00:05:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 00:05:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 00:05:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 00:05:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-12-03 00:05:56,389 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2018-12-03 00:05:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,389 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-12-03 00:05:56,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:05:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-12-03 00:05:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 00:05:56,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,390 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2021783647, now seen corresponding path program 1 times [2018-12-03 00:05:56,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:05:56,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:05:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:05:56,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:05:56,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:05:56,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:56,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:56,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 00:05:56,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:56,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:56,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:56,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:56,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,566 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-12-03 00:05:56,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-12-03 00:05:56,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:56,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-03 00:05:56,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,601 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-12-03 00:05:56,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-12-03 00:05:56,632 INFO L478 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-12-03 00:05:56,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-03 00:05:56,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:05:56,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:56,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-12-03 00:05:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:05:56,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-03 00:05:56,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:05:56,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:05:56,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:05:56,665 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-12-03 00:05:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,806 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-12-03 00:05:56,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:05:56,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-03 00:05:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,807 INFO L225 Difference]: With dead ends: 151 [2018-12-03 00:05:56,807 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 00:05:56,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:05:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 00:05:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2018-12-03 00:05:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 00:05:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-03 00:05:56,812 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 23 [2018-12-03 00:05:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,812 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-03 00:05:56,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:05:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-03 00:05:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 00:05:56,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,813 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,813 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2066926113, now seen corresponding path program 1 times [2018-12-03 00:05:56,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,838 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 3 states. [2018-12-03 00:05:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,864 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-12-03 00:05:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 00:05:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,866 INFO L225 Difference]: With dead ends: 181 [2018-12-03 00:05:56,866 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 00:05:56,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 00:05:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-12-03 00:05:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 00:05:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-12-03 00:05:56,872 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 24 [2018-12-03 00:05:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,873 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-12-03 00:05:56,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-12-03 00:05:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 00:05:56,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,874 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,874 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1129078447, now seen corresponding path program 1 times [2018-12-03 00:05:56,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 00:05:56,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:56,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:56,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,898 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 3 states. [2018-12-03 00:05:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:56,920 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-12-03 00:05:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:56,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 00:05:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:56,922 INFO L225 Difference]: With dead ends: 179 [2018-12-03 00:05:56,922 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 00:05:56,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 00:05:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-12-03 00:05:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 00:05:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-12-03 00:05:56,926 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 31 [2018-12-03 00:05:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:56,927 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-12-03 00:05:56,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-12-03 00:05:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 00:05:56,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:56,928 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:56,928 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:56,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash -323983759, now seen corresponding path program 1 times [2018-12-03 00:05:56,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:56,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:57,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:05:57,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:05:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:57,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:05:57,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:05:57,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:05:57,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,057 INFO L478 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-12-03 00:05:57,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:57,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:57,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:57,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:57,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,096 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-12-03 00:05:57,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-03 00:05:57,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 00:05:57,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-03 00:05:57,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,138 INFO L478 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-12-03 00:05:57,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,156 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2018-12-03 00:05:57,159 INFO L478 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 11 [2018-12-03 00:05:57,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,179 INFO L478 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 47 treesize of output 51 [2018-12-03 00:05:57,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:57,183 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,195 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:05:57,206 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2018-12-03 00:05:57,232 INFO L478 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 103 treesize of output 76 [2018-12-03 00:05:57,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-12-03 00:05:57,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 00:05:57,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-12-03 00:05:57,284 INFO L478 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-12-03 00:05:57,287 INFO L478 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-12-03 00:05:57,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:05:57,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-03 00:05:57,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-12-03 00:05:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:57,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:05:57,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-12-03 00:05:57,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 00:05:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 00:05:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:05:57,336 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 12 states. [2018-12-03 00:05:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:57,631 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2018-12-03 00:05:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 00:05:57,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-03 00:05:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:57,631 INFO L225 Difference]: With dead ends: 165 [2018-12-03 00:05:57,632 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 00:05:57,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-12-03 00:05:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 00:05:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 85. [2018-12-03 00:05:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 00:05:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-12-03 00:05:57,637 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 32 [2018-12-03 00:05:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:57,637 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-12-03 00:05:57,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 00:05:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-12-03 00:05:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 00:05:57,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:57,638 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:05:57,638 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:57,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1584673033, now seen corresponding path program 1 times [2018-12-03 00:05:57,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:57,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:57,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:05:57,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:05:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:57,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:05:57,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:05:57,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:05:57,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 00:05:57,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:57,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:57,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:57,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:05:57,892 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:57,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:57,911 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:57,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:05:57,921 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,924 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,933 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-12-03 00:05:57,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-03 00:05:57,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 00:05:57,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-12-03 00:05:57,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-03 00:05:57,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:57,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-12-03 00:05:57,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:57,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-03 00:05:57,995 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,005 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:57 [2018-12-03 00:05:58,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-12-03 00:05:58,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-03 00:05:58,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 00:05:58,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-03 00:05:58,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 00:05:58,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 00:05:58,061 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,066 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-12-03 00:05:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:58,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:05:58,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-12-03 00:05:58,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 00:05:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 00:05:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:05:58,110 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 14 states. [2018-12-03 00:05:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:58,447 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-12-03 00:05:58,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:05:58,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-03 00:05:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:58,448 INFO L225 Difference]: With dead ends: 108 [2018-12-03 00:05:58,448 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 00:05:58,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-12-03 00:05:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 00:05:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-12-03 00:05:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 00:05:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-12-03 00:05:58,453 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 33 [2018-12-03 00:05:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:58,453 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-12-03 00:05:58,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 00:05:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-12-03 00:05:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 00:05:58,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:58,454 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-03 00:05:58,454 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:58,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1808152883, now seen corresponding path program 1 times [2018-12-03 00:05:58,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:58,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 00:05:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:05:58,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:05:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:05:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:58,475 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2018-12-03 00:05:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:58,505 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-12-03 00:05:58,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:05:58,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-03 00:05:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:58,506 INFO L225 Difference]: With dead ends: 152 [2018-12-03 00:05:58,506 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 00:05:58,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:05:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 00:05:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-03 00:05:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 00:05:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-12-03 00:05:58,514 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 33 [2018-12-03 00:05:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:58,514 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-12-03 00:05:58,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:05:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-12-03 00:05:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 00:05:58,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:58,515 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-03 00:05:58,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:58,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1004579722, now seen corresponding path program 1 times [2018-12-03 00:05:58,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:58,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:58,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:05:58,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:05:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:58,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:05:58,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:05:58,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:05:58,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-03 00:05:58,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:58,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:58,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:58,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:05:58,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,718 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:58,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:58,740 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:58,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:05:58,751 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,755 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,768 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-12-03 00:05:58,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-03 00:05:58,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-03 00:05:58,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-12-03 00:05:58,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-03 00:05:58,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:58 [2018-12-03 00:05:58,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,863 INFO L478 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-12-03 00:05:58,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:58,888 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 116 [2018-12-03 00:05:58,891 INFO L478 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 28 treesize of output 31 [2018-12-03 00:05:58,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,914 INFO L478 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 101 treesize of output 105 [2018-12-03 00:05:58,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:58,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-12-03 00:05:58,955 INFO L478 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 23 [2018-12-03 00:05:58,956 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,969 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-12-03 00:05:58,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:58,972 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,979 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:58,994 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:155, output treesize:61 [2018-12-03 00:05:59,025 INFO L478 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 209 treesize of output 154 [2018-12-03 00:05:59,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:59,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-12-03 00:05:59,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 127 [2018-12-03 00:05:59,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:59,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-12-03 00:05:59,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,076 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-12-03 00:05:59,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:216, output treesize:106 [2018-12-03 00:05:59,104 INFO L478 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 114 treesize of output 71 [2018-12-03 00:05:59,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:05:59,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-03 00:05:59,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2018-12-03 00:05:59,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,132 INFO L478 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 15 treesize of output 15 [2018-12-03 00:05:59,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:05:59,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:05:59,136 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,139 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:121, output treesize:4 [2018-12-03 00:05:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:05:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-12-03 00:05:59,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 00:05:59,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 00:05:59,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 00:05:59,172 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-12-03 00:05:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:59,465 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-12-03 00:05:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 00:05:59,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-12-03 00:05:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:59,466 INFO L225 Difference]: With dead ends: 128 [2018-12-03 00:05:59,466 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 00:05:59,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-03 00:05:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 00:05:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-12-03 00:05:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 00:05:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-12-03 00:05:59,473 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 35 [2018-12-03 00:05:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:59,473 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-12-03 00:05:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 00:05:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-12-03 00:05:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 00:05:59,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:59,474 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 00:05:59,475 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:59,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1088300863, now seen corresponding path program 1 times [2018-12-03 00:05:59,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:59,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:59,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:59,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:59,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 00:05:59,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:05:59,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:05:59,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:05:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:05:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:05:59,498 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-12-03 00:05:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:05:59,530 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2018-12-03 00:05:59,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:05:59,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-03 00:05:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:05:59,531 INFO L225 Difference]: With dead ends: 131 [2018-12-03 00:05:59,531 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 00:05:59,531 INFO L631 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-12-03 00:05:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 00:05:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-12-03 00:05:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 00:05:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-12-03 00:05:59,537 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 41 [2018-12-03 00:05:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:05:59,537 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-12-03 00:05:59,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:05:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-12-03 00:05:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 00:05:59,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:05:59,538 INFO L402 BasicCegarLoop]: trace histogram [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-12-03 00:05:59,538 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:05:59,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:05:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -387236285, now seen corresponding path program 1 times [2018-12-03 00:05:59,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:05:59,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:05:59,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:59,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:59,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:05:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:59,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:05:59,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:05:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:05:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:05:59,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:05:59,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:05:59,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:05:59,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:59,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:59,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 00:05:59,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:59,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:59,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:05:59,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:59,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,727 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:05:59,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:05:59,739 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-03 00:05:59,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 00:05:59,747 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,750 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,752 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,758 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-12-03 00:05:59,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2018-12-03 00:05:59,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-12-03 00:05:59,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-12-03 00:05:59,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:05:59,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-03 00:05:59,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:42 [2018-12-03 00:05:59,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-12-03 00:05:59,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-12-03 00:05:59,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:05:59,844 INFO L478 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 15 treesize of output 15 [2018-12-03 00:05:59,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:05:59,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-03 00:05:59,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 00:05:59,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-03 00:05:59,861 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:05:59,869 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:72, output treesize:7 [2018-12-03 00:05:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:05:59,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:05:59,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-12-03 00:05:59,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 00:05:59,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 00:05:59,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:05:59,892 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 14 states. [2018-12-03 00:06:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:00,080 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-12-03 00:06:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:06:00,080 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-12-03 00:06:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:00,081 INFO L225 Difference]: With dead ends: 139 [2018-12-03 00:06:00,081 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 00:06:00,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-12-03 00:06:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 00:06:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 00:06:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 00:06:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-12-03 00:06:00,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 41 [2018-12-03 00:06:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-12-03 00:06:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 00:06:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-12-03 00:06:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 00:06:00,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:00,087 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 00:06:00,087 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1997813481, now seen corresponding path program 1 times [2018-12-03 00:06:00,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:00,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:00,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:06:00,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:06:00,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:00,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:06:00,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:06:00,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:06:00,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,215 INFO L478 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-12-03 00:06:00,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:00,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:00,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:00,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:00,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-12-03 00:06:00,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-03 00:06:00,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 00:06:00,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-03 00:06:00,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,285 INFO L478 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 50 [2018-12-03 00:06:00,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,303 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 65 [2018-12-03 00:06:00,306 INFO L478 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 11 [2018-12-03 00:06:00,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,320 INFO L478 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 56 treesize of output 60 [2018-12-03 00:06:00,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:00,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:00,349 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:96, output treesize:66 [2018-12-03 00:06:00,377 INFO L478 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 71 treesize of output 73 [2018-12-03 00:06:00,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 00:06:00,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,401 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-12-03 00:06:00,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2018-12-03 00:06:00,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,413 INFO L478 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-12-03 00:06:00,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 91 [2018-12-03 00:06:00,444 INFO L478 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 22 treesize of output 15 [2018-12-03 00:06:00,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,466 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2018-12-03 00:06:00,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:00,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:00,502 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2018-12-03 00:06:00,551 INFO L478 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 179 treesize of output 115 [2018-12-03 00:06:00,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:00,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-12-03 00:06:00,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,576 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-12-03 00:06:00,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2018-12-03 00:06:00,611 INFO L478 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-12-03 00:06:00,613 INFO L478 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 23 treesize of output 17 [2018-12-03 00:06:00,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:00,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,631 INFO L478 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-12-03 00:06:00,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-03 00:06:00,636 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:00,641 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-12-03 00:06:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:00,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:06:00,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-12-03 00:06:00,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 00:06:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 00:06:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:06:00,671 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 14 states. [2018-12-03 00:06:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:01,163 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-12-03 00:06:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 00:06:01,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-12-03 00:06:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:01,164 INFO L225 Difference]: With dead ends: 175 [2018-12-03 00:06:01,164 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 00:06:01,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-12-03 00:06:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 00:06:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 91. [2018-12-03 00:06:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 00:06:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-12-03 00:06:01,172 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 42 [2018-12-03 00:06:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:01,172 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-12-03 00:06:01,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 00:06:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-12-03 00:06:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 00:06:01,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:01,173 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-03 00:06:01,173 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:01,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1874896500, now seen corresponding path program 1 times [2018-12-03 00:06:01,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:01,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:01,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:06:01,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:06:01,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:01,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:06:01,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:06:01,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:06:01,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-03 00:06:01,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:01,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12-03 00:06:01,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:01,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:01,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:01,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:01,486 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-03 00:06:01,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 00:06:01,493 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,507 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-12-03 00:06:01,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-12-03 00:06:01,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-03 00:06:01,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-03 00:06:01,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-03 00:06:01,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-12-03 00:06:01,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 00:06:01,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,598 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:71 [2018-12-03 00:06:01,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-03 00:06:01,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 148 [2018-12-03 00:06:01,687 INFO L478 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 22 treesize of output 23 [2018-12-03 00:06:01,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 143 [2018-12-03 00:06:01,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:01,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-12-03 00:06:01,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-12-03 00:06:01,802 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,804 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-12-03 00:06:01,830 INFO L478 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 23 [2018-12-03 00:06:01,831 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-12-03 00:06:01,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:01,850 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,860 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-03 00:06:01,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-03 00:06:01,891 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,896 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,910 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:204, output treesize:68 [2018-12-03 00:06:01,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 182 [2018-12-03 00:06:01,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:01,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-12-03 00:06:01,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:01,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 148 [2018-12-03 00:06:01,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:02,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-12-03 00:06:02,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-12-03 00:06:02,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 00:06:02,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,035 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:02,047 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:248, output treesize:122 [2018-12-03 00:06:02,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 85 [2018-12-03 00:06:02,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-03 00:06:02,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2018-12-03 00:06:02,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:02,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:02,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:02,126 INFO L478 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 22 treesize of output 20 [2018-12-03 00:06:02,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 00:06:02,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:02,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,141 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-12-03 00:06:02,141 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:24 [2018-12-03 00:06:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:06:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-12-03 00:06:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 00:06:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 00:06:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2018-12-03 00:06:02,187 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-12-03 00:06:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:02,700 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-12-03 00:06:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:06:02,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-12-03 00:06:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:02,701 INFO L225 Difference]: With dead ends: 116 [2018-12-03 00:06:02,701 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 00:06:02,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2018-12-03 00:06:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 00:06:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-12-03 00:06:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 00:06:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-03 00:06:02,707 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-12-03 00:06:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:02,707 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-03 00:06:02,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 00:06:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-03 00:06:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 00:06:02,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:02,707 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 00:06:02,708 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:02,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1415179328, now seen corresponding path program 1 times [2018-12-03 00:06:02,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 00:06:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:06:02,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:06:02,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:06:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:06:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:06:02,722 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 3 states. [2018-12-03 00:06:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:02,742 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-12-03 00:06:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:06:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 00:06:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:02,743 INFO L225 Difference]: With dead ends: 125 [2018-12-03 00:06:02,743 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 00:06:02,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:06:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 00:06:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-12-03 00:06:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 00:06:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-12-03 00:06:02,751 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-12-03 00:06:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-12-03 00:06:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:06:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-12-03 00:06:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 00:06:02,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:02,752 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 00:06:02,752 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:02,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1495461684, now seen corresponding path program 1 times [2018-12-03 00:06:02,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:02,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:06:02,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:06:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:02,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:06:02,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:06:02,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:02,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:06:02,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:02,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:02,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-03 00:06:02,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:03,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:03,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:06:03,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:03,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:03,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:06:03,042 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,045 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,056 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-12-03 00:06:03,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-12-03 00:06:03,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-03 00:06:03,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-03 00:06:03,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-03 00:06:03,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-12-03 00:06:03,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,144 INFO L478 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-12-03 00:06:03,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 118 [2018-12-03 00:06:03,184 INFO L478 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 26 treesize of output 23 [2018-12-03 00:06:03,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,202 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 117 [2018-12-03 00:06:03,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,246 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 90 [2018-12-03 00:06:03,248 INFO L478 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 36 treesize of output 31 [2018-12-03 00:06:03,248 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,266 INFO L478 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 67 treesize of output 71 [2018-12-03 00:06:03,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,268 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,275 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,281 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,295 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:180, output treesize:83 [2018-12-03 00:06:03,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-12-03 00:06:03,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 00:06:03,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,383 INFO L478 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 67 treesize of output 69 [2018-12-03 00:06:03,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-03 00:06:03,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:80 [2018-12-03 00:06:03,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,418 INFO L478 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 37 treesize of output 73 [2018-12-03 00:06:03,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 185 [2018-12-03 00:06:03,459 INFO L478 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 26 treesize of output 19 [2018-12-03 00:06:03,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,489 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 180 [2018-12-03 00:06:03,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,539 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 134 [2018-12-03 00:06:03,542 INFO L478 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 26 treesize of output 19 [2018-12-03 00:06:03,542 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,558 INFO L478 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 125 treesize of output 129 [2018-12-03 00:06:03,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:03,560 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,570 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:03,591 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:292, output treesize:129 [2018-12-03 00:06:03,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 282 [2018-12-03 00:06:03,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-12-03 00:06:03,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,673 INFO L478 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 250 treesize of output 146 [2018-12-03 00:06:03,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:03,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-12-03 00:06:03,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:03,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:324, output treesize:190 [2018-12-03 00:06:03,736 INFO L478 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 198 treesize of output 98 [2018-12-03 00:06:03,737 INFO L478 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 36 treesize of output 28 [2018-12-03 00:06:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:03,749 INFO L478 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 52 treesize of output 19 [2018-12-03 00:06:03,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,758 INFO L478 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 19 treesize of output 13 [2018-12-03 00:06:03,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:03,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:03,775 INFO L478 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 15 treesize of output 15 [2018-12-03 00:06:03,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:03,777 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:03,780 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,780 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:03,784 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:4 [2018-12-03 00:06:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:06:03,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-12-03 00:06:03,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 00:06:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 00:06:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-03 00:06:03,810 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 19 states. [2018-12-03 00:06:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:04,586 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-12-03 00:06:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 00:06:04,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-12-03 00:06:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:04,587 INFO L225 Difference]: With dead ends: 181 [2018-12-03 00:06:04,587 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 00:06:04,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-12-03 00:06:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 00:06:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2018-12-03 00:06:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 00:06:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-12-03 00:06:04,595 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 45 [2018-12-03 00:06:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:04,595 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-12-03 00:06:04,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 00:06:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-12-03 00:06:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 00:06:04,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:04,595 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 00:06:04,596 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:04,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 400881353, now seen corresponding path program 1 times [2018-12-03 00:06:04,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:04,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:06:04,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/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-12-03 00:06:04,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:06:04,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:06:04,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 00:06:04,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 00:06:04,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:04,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-03 00:06:04,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:04,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:04,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:04,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:06:04,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:04,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 00:06:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:04,995 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 00:06:05,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-12-03 00:06:05,004 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,007 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,010 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,018 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-12-03 00:06:05,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-03 00:06:05,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-03 00:06:05,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-12-03 00:06:05,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-03 00:06:05,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-12-03 00:06:05,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,131 INFO L478 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 26 treesize of output 46 [2018-12-03 00:06:05,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 119 [2018-12-03 00:06:05,174 INFO L478 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 22 treesize of output 23 [2018-12-03 00:06:05,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 114 [2018-12-03 00:06:05,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:05,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,239 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 00:06:05,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-12-03 00:06:05,241 INFO L478 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-12-03 00:06:05,241 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-12-03 00:06:05,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 19 [2018-12-03 00:06:05,254 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,261 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,280 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:163, output treesize:109 [2018-12-03 00:06:05,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 103 [2018-12-03 00:06:05,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-12-03 00:06:05,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 110 [2018-12-03 00:06:05,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-12-03 00:06:05,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:144, output treesize:118 [2018-12-03 00:06:05,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,437 INFO L478 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 37 treesize of output 73 [2018-12-03 00:06:05,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 215 [2018-12-03 00:06:05,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 48 [2018-12-03 00:06:05,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 203 [2018-12-03 00:06:05,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:05,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,620 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 153 [2018-12-03 00:06:05,625 INFO L478 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 38 treesize of output 47 [2018-12-03 00:06:05,625 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,647 INFO L478 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 116 treesize of output 156 [2018-12-03 00:06:05,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 00:06:05,649 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,660 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,668 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,681 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:307, output treesize:112 [2018-12-03 00:06:05,721 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 289 [2018-12-03 00:06:05,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-12-03 00:06:05,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 165 [2018-12-03 00:06:05,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-12-03 00:06:05,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,808 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-12-03 00:06:05,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:323, output treesize:189 [2018-12-03 00:06:05,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 00:06:05,886 INFO L478 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 7 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 126 [2018-12-03 00:06:05,892 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2018-12-03 00:06:05,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-03 00:06:05,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:05,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:05,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-03 00:06:05,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 00:06:05,932 INFO L478 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 26 treesize of output 30 [2018-12-03 00:06:05,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:05,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 00:06:05,938 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 00:06:05,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:06:05,943 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:220, output treesize:4 [2018-12-03 00:06:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:06:05,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 00:06:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-12-03 00:06:05,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 00:06:05,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 00:06:05,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-03 00:06:05,972 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 19 states. [2018-12-03 00:06:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:06:06,708 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-12-03 00:06:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:06:06,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-03 00:06:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:06:06,708 INFO L225 Difference]: With dead ends: 156 [2018-12-03 00:06:06,709 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 00:06:06,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-12-03 00:06:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 00:06:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-12-03 00:06:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 00:06:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-12-03 00:06:06,716 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 48 [2018-12-03 00:06:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:06:06,716 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-12-03 00:06:06,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 00:06:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-12-03 00:06:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 00:06:06,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:06:06,716 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 00:06:06,716 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:06:06,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:06:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1643497090, now seen corresponding path program 1 times [2018-12-03 00:06:06,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 00:06:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 00:06:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:06,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:06:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:06:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:06:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 00:06:06,762 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 00:06:06,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:06:06 BoogieIcfgContainer [2018-12-03 00:06:06,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:06:06,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:06:06,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:06:06,795 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:06:06,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:05:55" (3/4) ... [2018-12-03 00:06:06,797 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 00:06:06,829 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_212528f8-328c-4c6a-8594-72c7bc33829a/bin-2019/uautomizer/witness.graphml [2018-12-03 00:06:06,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:06:06,830 INFO L168 Benchmark]: Toolchain (without parser) took 11504.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 956.0 MB in the beginning and 818.6 MB in the end (delta: 137.4 MB). Peak memory consumption was 515.9 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,831 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:06:06,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:06:06,831 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,831 INFO L168 Benchmark]: RCFGBuilder took 259.98 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,832 INFO L168 Benchmark]: TraceAbstraction took 10885.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 259.4 MB). Peak memory consumption was 495.3 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,832 INFO L168 Benchmark]: Witness Printer took 34.61 ms. Allocated memory is still 1.4 GB. Free memory was 828.2 MB in the beginning and 818.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:06:06,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.98 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10885.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 259.4 MB). Peak memory consumption was 495.3 MB. Max. memory is 11.5 GB. * Witness Printer took 34.61 ms. Allocated memory is still 1.4 GB. Free memory was 828.2 MB in the beginning and 818.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 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] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={23:0}, item={23:0}, malloc(sizeof(SLL))={23:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={26:0}, malloc(sizeof(SLL))={23:0}, status=0] [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={26:0}, malloc(sizeof(SLL))={23:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={26:0}, malloc(sizeof(SLL))={23:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={26:0}, malloc(sizeof(SLL))={23:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, status=1] [L997] COND FALSE !(!status) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, status=1] [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={23:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=2] [L997] COND FALSE !(!status) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1032] EXPR head->next VAL [head={23:0}, head->next={26:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, head->next->next->next->data=3, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={29:0}, malloc(sizeof(SLL))={23:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. UNSAFE Result, 10.8s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1481 SDtfs, 1915 SDslu, 5161 SDs, 0 SdLazy, 2774 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 331 SyntacticMatches, 16 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=20, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 415 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 920 ConstructedInterpolants, 141 QuantifiedInterpolants, 1243414 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1297 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 68/318 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...