./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.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_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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 70bf824eb1ce7a6b047f1b7928100a687c12a44d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 08:18:17,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:18:17,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:18:17,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:18:17,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:18:17,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:18:17,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:18:17,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:18:17,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:18:17,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:18:17,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:18:17,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:18:17,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:18:17,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:18:17,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:18:17,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:18:17,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:18:17,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:18:17,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:18:17,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:18:17,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:18:17,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:18:17,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:18:17,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:18:17,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:18:17,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:18:17,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:18:17,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:18:17,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:18:17,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:18:17,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:18:17,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:18:17,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:18:17,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:18:17,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:18:17,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:18:17,293 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 08:18:17,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:18:17,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:18:17,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:18:17,301 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:18:17,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:18:17,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:18:17,301 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:18:17,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:18:17,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:18:17,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:18:17,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:18:17,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:18:17,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:18:17,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:18:17,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:18:17,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:18:17,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:18:17,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 08:18:17,304 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_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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 -> 70bf824eb1ce7a6b047f1b7928100a687c12a44d [2018-12-08 08:18:17,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:18:17,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:18:17,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:18:17,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:18:17,331 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:18:17,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-12-08 08:18:17,365 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/data/19f239a93/dcf5756bf7cf4dc89efe411ac69e92e7/FLAG9c8c794c6 [2018-12-08 08:18:17,671 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:18:17,671 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-12-08 08:18:17,675 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/data/19f239a93/dcf5756bf7cf4dc89efe411ac69e92e7/FLAG9c8c794c6 [2018-12-08 08:18:18,097 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/data/19f239a93/dcf5756bf7cf4dc89efe411ac69e92e7 [2018-12-08 08:18:18,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:18:18,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:18:18,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:18:18,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:18:18,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:18:18,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf82b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18, skipping insertion in model container [2018-12-08 08:18:18,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:18:18,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:18:18,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:18:18,217 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:18:18,237 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:18:18,248 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:18:18,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18 WrapperNode [2018-12-08 08:18:18,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:18:18,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:18:18,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:18:18,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:18:18,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:18:18,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:18:18,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:18:18,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:18:18,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... [2018-12-08 08:18:18,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:18:18,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:18:18,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:18:18,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:18:18,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:18:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:18:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 08:18:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:18:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:18:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 08:18:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 08:18:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:18:18,505 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:18:18,505 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 08:18:18,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:18:18 BoogieIcfgContainer [2018-12-08 08:18:18,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:18:18,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:18:18,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:18:18,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:18:18,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:18:18" (1/3) ... [2018-12-08 08:18:18,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50765b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:18:18, skipping insertion in model container [2018-12-08 08:18:18,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:18:18" (2/3) ... [2018-12-08 08:18:18,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50765b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:18:18, skipping insertion in model container [2018-12-08 08:18:18,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:18:18" (3/3) ... [2018-12-08 08:18:18,510 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_false-unreach-call_true-termination.i [2018-12-08 08:18:18,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:18:18,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:18:18,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:18:18,550 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:18:18,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:18:18,551 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:18:18,551 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:18:18,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:18:18,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:18:18,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:18:18,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:18:18,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:18:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-08 08:18:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 08:18:18,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:18,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:18,567 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -539958144, now seen corresponding path program 1 times [2018-12-08 08:18:18,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:18,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:18,709 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-08 08:18:18,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:18:18,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:18:18,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:18:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:18:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:18:18,721 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-12-08 08:18:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:18,804 INFO L93 Difference]: Finished difference Result 98 states and 149 transitions. [2018-12-08 08:18:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:18:18,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-08 08:18:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:18,811 INFO L225 Difference]: With dead ends: 98 [2018-12-08 08:18:18,811 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 08:18:18,813 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-08 08:18:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 08:18:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-12-08 08:18:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-08 08:18:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-08 08:18:18,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2018-12-08 08:18:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:18,839 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-08 08:18:18,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:18:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-08 08:18:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:18:18,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:18,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:18,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:18,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2104518782, now seen corresponding path program 1 times [2018-12-08 08:18:18,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:18,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:18,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:18,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:18,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:18,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:19,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 08:18:19,045 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-08 08:18:19,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-08 08:18:19,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 08:18:19,063 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-08 08:18:19,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:19,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-08 08:18:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:19,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-08 08:18:19,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:18:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:18:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:18:19,104 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 9 states. [2018-12-08 08:18:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:19,199 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-12-08 08:18:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:18:19,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-08 08:18:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:19,200 INFO L225 Difference]: With dead ends: 78 [2018-12-08 08:18:19,200 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 08:18:19,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:18:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 08:18:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-12-08 08:18:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 08:18:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2018-12-08 08:18:19,207 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2018-12-08 08:18:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:19,207 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2018-12-08 08:18:19,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:18:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-12-08 08:18:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:18:19,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:19,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:19,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:19,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1083450428, now seen corresponding path program 1 times [2018-12-08 08:18:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:19,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:18:19,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:18:19,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:18:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:18:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:18:19,235 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2018-12-08 08:18:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:19,255 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2018-12-08 08:18:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:18:19,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 08:18:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:19,257 INFO L225 Difference]: With dead ends: 82 [2018-12-08 08:18:19,257 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 08:18:19,258 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-08 08:18:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 08:18:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-08 08:18:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 08:18:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-12-08 08:18:19,265 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2018-12-08 08:18:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:19,265 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-12-08 08:18:19,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:18:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-12-08 08:18:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 08:18:19,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:19,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:19,266 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:19,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash 3338338, now seen corresponding path program 1 times [2018-12-08 08:18:19,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:19,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:19,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:19,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:19,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:19,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-08 08:18:19,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 08:18:19,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:18:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:18:19,390 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 8 states. [2018-12-08 08:18:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:19,455 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-12-08 08:18:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:18:19,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-08 08:18:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:19,456 INFO L225 Difference]: With dead ends: 130 [2018-12-08 08:18:19,456 INFO L226 Difference]: Without dead ends: 94 [2018-12-08 08:18:19,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:18:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-08 08:18:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2018-12-08 08:18:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 08:18:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-12-08 08:18:19,462 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2018-12-08 08:18:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:19,463 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-12-08 08:18:19,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 08:18:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-12-08 08:18:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 08:18:19,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:19,463 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:19,463 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:19,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1687190263, now seen corresponding path program 1 times [2018-12-08 08:18:19,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:19,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:19,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:19,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:19,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:19,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-08 08:18:19,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:18:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:18:19,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:18:19,585 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 10 states. [2018-12-08 08:18:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:19,749 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2018-12-08 08:18:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:18:19,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-08 08:18:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:19,750 INFO L225 Difference]: With dead ends: 195 [2018-12-08 08:18:19,750 INFO L226 Difference]: Without dead ends: 165 [2018-12-08 08:18:19,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:18:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-08 08:18:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2018-12-08 08:18:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-08 08:18:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2018-12-08 08:18:19,759 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2018-12-08 08:18:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:19,760 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-12-08 08:18:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:18:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-12-08 08:18:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 08:18:19,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:19,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:19,761 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1281163029, now seen corresponding path program 1 times [2018-12-08 08:18:19,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:19,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:20,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:20,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:20,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:18:20,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-08 08:18:20,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-08 08:18:20,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2018-12-08 08:18:20,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,497 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 29 [2018-12-08 08:18:20,499 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 18 treesize of output 16 [2018-12-08 08:18:20,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-08 08:18:20,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,557 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 37 treesize of output 55 [2018-12-08 08:18:20,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,569 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-08 08:18:20,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:18:20,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,590 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-08 08:18:20,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-12-08 08:18:20,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,648 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 40 treesize of output 38 [2018-12-08 08:18:20,654 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 21 [2018-12-08 08:18:20,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 08:18:20,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:20,666 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 20 treesize of output 10 [2018-12-08 08:18:20,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:20,672 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-08 08:18:20,672 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:3 [2018-12-08 08:18:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:20,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:20,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-12-08 08:18:20,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-08 08:18:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-08 08:18:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-12-08 08:18:20,721 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 24 states. [2018-12-08 08:18:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:21,963 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2018-12-08 08:18:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 08:18:21,963 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-08 08:18:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:21,965 INFO L225 Difference]: With dead ends: 225 [2018-12-08 08:18:21,965 INFO L226 Difference]: Without dead ends: 223 [2018-12-08 08:18:21,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=1426, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 08:18:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-08 08:18:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 89. [2018-12-08 08:18:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-08 08:18:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2018-12-08 08:18:21,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 31 [2018-12-08 08:18:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:21,978 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2018-12-08 08:18:21,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-08 08:18:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-12-08 08:18:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 08:18:21,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:21,979 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] [2018-12-08 08:18:21,980 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:21,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1972596862, now seen corresponding path program 2 times [2018-12-08 08:18:21,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:21,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:21,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:18:22,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:22,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:22,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:18:22,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:18:22,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:22,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:22,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-08 08:18:22,145 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-08 08:18:22,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-08 08:18:22,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-08 08:18:22,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:22,192 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 16 treesize of output 23 [2018-12-08 08:18:22,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-12-08 08:18:22,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 08:18:22,220 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-08 08:18:22,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:22,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-08 08:18:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:18:22,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-12-08 08:18:22,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:18:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:18:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:18:22,250 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 13 states. [2018-12-08 08:18:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:22,484 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2018-12-08 08:18:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 08:18:22,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-08 08:18:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:22,485 INFO L225 Difference]: With dead ends: 305 [2018-12-08 08:18:22,485 INFO L226 Difference]: Without dead ends: 229 [2018-12-08 08:18:22,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-12-08 08:18:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-08 08:18:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 102. [2018-12-08 08:18:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 08:18:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-12-08 08:18:22,501 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 31 [2018-12-08 08:18:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:22,501 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-12-08 08:18:22,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:18:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-12-08 08:18:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 08:18:22,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:22,503 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 08:18:22,503 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:22,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1698114635, now seen corresponding path program 1 times [2018-12-08 08:18:22,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:22,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:22,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:22,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:22,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:22,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:22,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:22,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-08 08:18:22,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:18:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:18:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:18:22,614 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 10 states. [2018-12-08 08:18:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:22,711 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2018-12-08 08:18:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:18:22,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-08 08:18:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:22,712 INFO L225 Difference]: With dead ends: 223 [2018-12-08 08:18:22,712 INFO L226 Difference]: Without dead ends: 154 [2018-12-08 08:18:22,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:18:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-08 08:18:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2018-12-08 08:18:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-08 08:18:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-12-08 08:18:22,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 33 [2018-12-08 08:18:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:22,722 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-12-08 08:18:22,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:18:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2018-12-08 08:18:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 08:18:22,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:22,723 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 08:18:22,723 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:22,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1142223879, now seen corresponding path program 2 times [2018-12-08 08:18:22,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:22,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:22,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:22,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:22,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:22,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:22,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:18:22,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:18:22,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:22,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:22,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-08 08:18:22,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 08:18:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 08:18:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-08 08:18:22,826 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand 10 states. [2018-12-08 08:18:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:22,951 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2018-12-08 08:18:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 08:18:22,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-12-08 08:18:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:22,952 INFO L225 Difference]: With dead ends: 214 [2018-12-08 08:18:22,952 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 08:18:22,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-08 08:18:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 08:18:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2018-12-08 08:18:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-08 08:18:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2018-12-08 08:18:22,964 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 34 [2018-12-08 08:18:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:22,964 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2018-12-08 08:18:22,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 08:18:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2018-12-08 08:18:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 08:18:22,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:22,965 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] [2018-12-08 08:18:22,965 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:22,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1647290398, now seen corresponding path program 3 times [2018-12-08 08:18:22,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:22,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:23,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:23,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:23,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 08:18:23,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 08:18:23,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:23,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:23,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:18:23,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,849 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-08 08:18:23,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-08 08:18:23,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2018-12-08 08:18:23,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,908 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 28 treesize of output 38 [2018-12-08 08:18:23,909 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 18 treesize of output 16 [2018-12-08 08:18:23,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:23,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2018-12-08 08:18:23,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,979 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 50 treesize of output 68 [2018-12-08 08:18:23,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:23,992 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-08 08:18:23,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:18:24,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:24,016 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-08 08:18:24,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-12-08 08:18:24,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,107 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 64 treesize of output 80 [2018-12-08 08:18:24,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,129 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-12-08 08:18:24,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:24,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:24,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:24,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:298 [2018-12-08 08:18:24,627 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 39 [2018-12-08 08:18:24,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,680 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 77 treesize of output 65 [2018-12-08 08:18:24,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:24,711 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 92 [2018-12-08 08:18:24,712 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 08:18:24,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-12-08 08:18:24,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2018-12-08 08:18:24,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 08:18:24,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2018-12-08 08:18:24,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:24,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:24,802 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-08 08:18:24,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:3 [2018-12-08 08:18:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:24,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2018-12-08 08:18:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-08 08:18:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-08 08:18:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-12-08 08:18:24,867 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 30 states. [2018-12-08 08:18:27,828 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-12-08 08:18:28,524 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-12-08 08:18:29,870 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2018-12-08 08:18:30,829 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2018-12-08 08:18:32,757 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2018-12-08 08:18:36,037 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2018-12-08 08:18:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:39,195 INFO L93 Difference]: Finished difference Result 705 states and 906 transitions. [2018-12-08 08:18:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-08 08:18:39,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-12-08 08:18:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:39,197 INFO L225 Difference]: With dead ends: 705 [2018-12-08 08:18:39,197 INFO L226 Difference]: Without dead ends: 657 [2018-12-08 08:18:39,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3324 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1545, Invalid=9167, Unknown=0, NotChecked=0, Total=10712 [2018-12-08 08:18:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-12-08 08:18:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 184. [2018-12-08 08:18:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 08:18:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-12-08 08:18:39,223 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 37 [2018-12-08 08:18:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:39,224 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-12-08 08:18:39,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-08 08:18:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-12-08 08:18:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 08:18:39,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:39,224 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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-08 08:18:39,224 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:39,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2064143268, now seen corresponding path program 3 times [2018-12-08 08:18:39,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:39,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:39,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 08:18:39,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:39,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/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-08 08:18:39,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 08:18:39,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 08:18:39,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:39,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:39,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:18:39,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-08 08:18:39,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:39,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-08 08:18:39,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-12-08 08:18:39,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-08 08:18:39,348 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-08 08:18:39,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-08 08:18:39,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-08 08:18:39,379 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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-12-08 08:18:39,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 08:18:39,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:18:39,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:18:39,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:33 [2018-12-08 08:18:39,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 08:18:39,509 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 08:18:39,509 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 11 [2018-12-08 08:18:39,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:39,514 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-08 08:18:39,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-12-08 08:18:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 08:18:39,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:39,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 18 [2018-12-08 08:18:39,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 08:18:39,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 08:18:39,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:18:39,556 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 18 states. [2018-12-08 08:18:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:40,133 INFO L93 Difference]: Finished difference Result 406 states and 538 transitions. [2018-12-08 08:18:40,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 08:18:40,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-12-08 08:18:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:40,134 INFO L225 Difference]: With dead ends: 406 [2018-12-08 08:18:40,134 INFO L226 Difference]: Without dead ends: 264 [2018-12-08 08:18:40,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-12-08 08:18:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-08 08:18:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 180. [2018-12-08 08:18:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 08:18:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-12-08 08:18:40,163 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 37 [2018-12-08 08:18:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:40,163 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-12-08 08:18:40,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 08:18:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-12-08 08:18:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 08:18:40,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:40,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:40,164 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:40,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2011969310, now seen corresponding path program 4 times [2018-12-08 08:18:40,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:40,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:40,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:40,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:18:40,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 08:18:40,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 08:18:40,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:40,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:40,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:40,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-12-08 08:18:40,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:18:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:18:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 08:18:40,293 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 14 states. [2018-12-08 08:18:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:40,537 INFO L93 Difference]: Finished difference Result 438 states and 581 transitions. [2018-12-08 08:18:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:18:40,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-08 08:18:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:40,538 INFO L225 Difference]: With dead ends: 438 [2018-12-08 08:18:40,538 INFO L226 Difference]: Without dead ends: 417 [2018-12-08 08:18:40,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-08 08:18:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-08 08:18:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 195. [2018-12-08 08:18:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-08 08:18:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-12-08 08:18:40,561 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 37 [2018-12-08 08:18:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:40,561 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-12-08 08:18:40,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:18:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-12-08 08:18:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 08:18:40,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:40,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:40,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:40,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1447053639, now seen corresponding path program 1 times [2018-12-08 08:18:40,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:40,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:40,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:18:40,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:40,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:18:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:40,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:40,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 08:18:40,733 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 10 treesize of output 9 [2018-12-08 08:18:40,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-08 08:18:40,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 08:18:40,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 08:18:40,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:40,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-12-08 08:18:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:18:40,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:40,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-12-08 08:18:40,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 08:18:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 08:18:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-08 08:18:40,805 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 18 states. [2018-12-08 08:18:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:41,191 INFO L93 Difference]: Finished difference Result 385 states and 505 transitions. [2018-12-08 08:18:41,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 08:18:41,191 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-08 08:18:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:41,192 INFO L225 Difference]: With dead ends: 385 [2018-12-08 08:18:41,192 INFO L226 Difference]: Without dead ends: 383 [2018-12-08 08:18:41,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 08:18:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-08 08:18:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 298. [2018-12-08 08:18:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-08 08:18:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2018-12-08 08:18:41,235 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 39 [2018-12-08 08:18:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:41,235 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2018-12-08 08:18:41,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 08:18:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2018-12-08 08:18:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 08:18:41,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:41,236 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:41,236 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:41,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1460763138, now seen corresponding path program 4 times [2018-12-08 08:18:41,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:41,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:41,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:41,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:41,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:18:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 08:18:41,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 08:18:41,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:41,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:18:41,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:41,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-08 08:18:41,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:18:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:18:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:18:41,373 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand 13 states. [2018-12-08 08:18:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:41,736 INFO L93 Difference]: Finished difference Result 645 states and 833 transitions. [2018-12-08 08:18:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 08:18:41,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-08 08:18:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:41,738 INFO L225 Difference]: With dead ends: 645 [2018-12-08 08:18:41,738 INFO L226 Difference]: Without dead ends: 598 [2018-12-08 08:18:41,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-12-08 08:18:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-08 08:18:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 403. [2018-12-08 08:18:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-08 08:18:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-12-08 08:18:41,798 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 40 [2018-12-08 08:18:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:41,798 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-12-08 08:18:41,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:18:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-12-08 08:18:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 08:18:41,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:41,799 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-08 08:18:41,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:41,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1132726254, now seen corresponding path program 1 times [2018-12-08 08:18:41,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:41,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 08:18:41,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:18:41,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:18:41,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 08:18:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:18:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:18:41,825 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 5 states. [2018-12-08 08:18:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:41,913 INFO L93 Difference]: Finished difference Result 671 states and 891 transitions. [2018-12-08 08:18:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:18:41,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-08 08:18:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:41,915 INFO L225 Difference]: With dead ends: 671 [2018-12-08 08:18:41,915 INFO L226 Difference]: Without dead ends: 433 [2018-12-08 08:18:41,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:18:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-12-08 08:18:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 398. [2018-12-08 08:18:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-08 08:18:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 524 transitions. [2018-12-08 08:18:41,980 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 524 transitions. Word has length 40 [2018-12-08 08:18:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:41,980 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 524 transitions. [2018-12-08 08:18:41,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 08:18:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 524 transitions. [2018-12-08 08:18:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 08:18:41,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:41,981 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:41,981 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:41,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 930411959, now seen corresponding path program 5 times [2018-12-08 08:18:41,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:18:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:42,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:42,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:18:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-08 08:18:42,063 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-12-08 08:18:42,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:42,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:18:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-12-08 08:18:42,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 08:18:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 08:18:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:18:42,143 INFO L87 Difference]: Start difference. First operand 398 states and 524 transitions. Second operand 16 states. [2018-12-08 08:18:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:18:42,650 INFO L93 Difference]: Finished difference Result 978 states and 1291 transitions. [2018-12-08 08:18:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 08:18:42,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-12-08 08:18:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:18:42,651 INFO L225 Difference]: With dead ends: 978 [2018-12-08 08:18:42,651 INFO L226 Difference]: Without dead ends: 921 [2018-12-08 08:18:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-12-08 08:18:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-12-08 08:18:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 443. [2018-12-08 08:18:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-08 08:18:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 585 transitions. [2018-12-08 08:18:42,720 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 585 transitions. Word has length 40 [2018-12-08 08:18:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:18:42,720 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 585 transitions. [2018-12-08 08:18:42,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 08:18:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 585 transitions. [2018-12-08 08:18:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 08:18:42,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:18:42,721 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:18:42,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:18:42,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:18:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1598984565, now seen corresponding path program 5 times [2018-12-08 08:18:42,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:18:42,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:18:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:42,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:18:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:18:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:18:43,640 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 37 [2018-12-08 08:18:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:18:44,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:18:44,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:18:44,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-08 08:18:44,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-12-08 08:18:44,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:18:44,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:18:44,436 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:18:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-12-08 08:18:44,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-08 08:18:44,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:39 [2018-12-08 08:18:44,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,506 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 37 treesize of output 47 [2018-12-08 08:18:44,508 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 18 treesize of output 16 [2018-12-08 08:18:44,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-12-08 08:18:44,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,609 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 59 treesize of output 77 [2018-12-08 08:18:44,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,621 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-12-08 08:18:44,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:18:44,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:18:44,648 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-08 08:18:44,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-12-08 08:18:44,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,832 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 79 treesize of output 95 [2018-12-08 08:18:44,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:44,890 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-12-08 08:18:44,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:45,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:45,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:45,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:384 [2018-12-08 08:18:46,173 WARN L180 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 08:18:46,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 115 [2018-12-08 08:18:46,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:46,210 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 128 [2018-12-08 08:18:46,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:46,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:46,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-12-08 08:18:46,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:488 [2018-12-08 08:18:48,630 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 163 DAG size of output: 65 [2018-12-08 08:18:57,094 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 08:18:59,279 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 64 [2018-12-08 08:18:59,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:59,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:18:59,472 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 102 treesize of output 84 [2018-12-08 08:18:59,499 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 87 [2018-12-08 08:18:59,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 08:18:59,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 438 dim-0 vars, End of recursive call: 462 dim-0 vars, and 477 xjuncts. [2018-12-08 08:19:04,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 08:19:04,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:19:04,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 64 [2018-12-08 08:19:04,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:19:04,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-12-08 08:19:04,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 08:19:04,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:19:04,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-12-08 08:19:04,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-08 08:19:04,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:19:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:19:04,212 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:114, output treesize:3 [2018-12-08 08:19:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:19:04,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:19:04,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-12-08 08:19:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-08 08:19:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-08 08:19:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1538, Unknown=3, NotChecked=0, Total=1722 [2018-12-08 08:19:04,291 INFO L87 Difference]: Start difference. First operand 443 states and 585 transitions. Second operand 42 states. [2018-12-08 08:19:05,294 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-12-08 08:19:05,463 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-12-08 08:19:12,674 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-12-08 08:19:14,121 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2018-12-08 08:19:16,680 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 138 DAG size of output: 70 [2018-12-08 08:19:20,434 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-12-08 08:19:20,615 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2018-12-08 08:19:21,589 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2018-12-08 08:19:25,187 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-08 08:19:31,902 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2018-12-08 08:19:34,854 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2018-12-08 08:19:35,614 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2018-12-08 08:19:41,200 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2018-12-08 08:19:41,894 WARN L180 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 72 [2018-12-08 08:19:53,688 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 127 DAG size of output: 74 [2018-12-08 08:19:55,822 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2018-12-08 08:20:01,004 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 137 DAG size of output: 70 [2018-12-08 08:20:07,367 WARN L180 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-12-08 08:20:08,518 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-12-08 08:20:21,318 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2018-12-08 08:20:29,802 WARN L180 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-12-08 08:20:31,954 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 124 DAG size of output: 74 [2018-12-08 08:20:47,536 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2018-12-08 08:20:49,276 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 134 DAG size of output: 70 [2018-12-08 08:20:59,881 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-12-08 08:21:02,011 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 129 DAG size of output: 74 [2018-12-08 08:21:05,216 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2018-12-08 08:21:09,568 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-08 08:21:24,473 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-12-08 08:21:31,366 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-12-08 08:21:56,485 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-08 08:21:58,627 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-12-08 08:22:26,517 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-12-08 08:22:30,646 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2018-12-08 08:22:31,684 WARN L180 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2018-12-08 08:22:34,092 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-12-08 08:22:47,425 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2018-12-08 08:22:56,867 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2018-12-08 08:23:03,720 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-12-08 08:23:12,581 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2018-12-08 08:23:18,721 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-08 08:23:20,876 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-08 08:23:41,666 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 130 DAG size of output: 66 [2018-12-08 08:23:53,880 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 127 DAG size of output: 73 [2018-12-08 08:23:54,086 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 89 [2018-12-08 08:23:55,713 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-12-08 08:24:11,950 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-12-08 08:24:12,546 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2018-12-08 08:24:14,718 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2018-12-08 08:24:25,020 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2018-12-08 08:24:27,615 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2018-12-08 08:24:30,531 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-12-08 08:24:45,838 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-12-08 08:24:46,828 WARN L180 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-12-08 08:24:47,634 WARN L180 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2018-12-08 08:24:47,983 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-12-08 08:25:04,943 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-12-08 08:25:07,099 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2018-12-08 08:25:12,000 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 70 [2018-12-08 08:25:20,814 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-12-08 08:25:22,984 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 125 DAG size of output: 70 [2018-12-08 08:25:27,447 WARN L180 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2018-12-08 08:25:41,893 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-12-08 08:25:44,076 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-12-08 08:26:01,125 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 132 DAG size of output: 72 [2018-12-08 08:26:01,704 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2018-12-08 08:26:20,551 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2018-12-08 08:26:22,870 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2018-12-08 08:26:37,221 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2018-12-08 08:26:49,734 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-08 08:26:50,233 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2018-12-08 08:26:52,376 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2018-12-08 08:26:56,498 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-12-08 08:27:21,695 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 117 DAG size of output: 67 [2018-12-08 08:28:00,250 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2018-12-08 08:28:06,600 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2018-12-08 08:28:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:28:31,622 INFO L93 Difference]: Finished difference Result 1629 states and 2091 transitions. [2018-12-08 08:28:31,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-12-08 08:28:31,622 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2018-12-08 08:28:31,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:28:31,625 INFO L225 Difference]: With dead ends: 1629 [2018-12-08 08:28:31,625 INFO L226 Difference]: Without dead ends: 1569 [2018-12-08 08:28:31,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17643 ImplicationChecksByTransitivity, 335.3s TimeCoverageRelationStatistics Valid=5016, Invalid=42646, Unknown=80, NotChecked=0, Total=47742 [2018-12-08 08:28:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-12-08 08:28:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 454. [2018-12-08 08:28:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-12-08 08:28:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 603 transitions. [2018-12-08 08:28:31,729 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 603 transitions. Word has length 43 [2018-12-08 08:28:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:28:31,729 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 603 transitions. [2018-12-08 08:28:31,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-08 08:28:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 603 transitions. [2018-12-08 08:28:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 08:28:31,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:28:31,730 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:28:31,730 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:28:31,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:28:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1762986130, now seen corresponding path program 2 times [2018-12-08 08:28:31,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:28:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:28:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:28:31,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:28:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:28:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:28:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:28:31,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:28:31,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:28:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:28:31,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:28:31,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:28:31,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:28:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:28:31,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:28:31,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-08 08:28:31,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:28:31,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:28:31,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:28:31,858 INFO L87 Difference]: Start difference. First operand 454 states and 603 transitions. Second operand 13 states. [2018-12-08 08:28:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:28:32,237 INFO L93 Difference]: Finished difference Result 851 states and 1110 transitions. [2018-12-08 08:28:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:28:32,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-12-08 08:28:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:28:32,238 INFO L225 Difference]: With dead ends: 851 [2018-12-08 08:28:32,239 INFO L226 Difference]: Without dead ends: 790 [2018-12-08 08:28:32,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-08 08:28:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-08 08:28:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 478. [2018-12-08 08:28:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-12-08 08:28:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 635 transitions. [2018-12-08 08:28:32,326 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 635 transitions. Word has length 43 [2018-12-08 08:28:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:28:32,326 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 635 transitions. [2018-12-08 08:28:32,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:28:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 635 transitions. [2018-12-08 08:28:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 08:28:32,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:28:32,327 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:28:32,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:28:32,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:28:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1423252674, now seen corresponding path program 6 times [2018-12-08 08:28:32,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:28:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:28:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:28:32,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:28:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:28:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:28:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 08:28:32,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:28:32,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:28:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-08 08:28:32,613 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-12-08 08:28:32,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:28:32,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:28:32,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-08 08:28:32,630 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-08 08:28:32,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-08 08:28:32,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 08:28:32,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,669 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 18 treesize of output 27 [2018-12-08 08:28:32,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2018-12-08 08:28:32,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-08 08:28:32,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,721 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 25 treesize of output 52 [2018-12-08 08:28:32,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:28:32,731 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-08 08:28:32,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-12-08 08:28:32,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-12-08 08:28:32,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:28:32,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 35 treesize of output 77 [2018-12-08 08:28:32,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 08:28:32,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:28:32,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 08:28:32,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:97 [2018-12-08 08:28:33,084 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-08 08:28:37,165 WARN L180 SmtUtils]: Spent 3.73 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-08 08:28:41,833 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-08 08:28:47,993 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 08:28:53,922 WARN L180 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 08:28:59,791 WARN L180 SmtUtils]: Spent 3.82 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 08:29:03,810 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-12-08 08:29:04,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-08 08:29:04,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:29:04,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:29:04,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 19 [2018-12-08 08:29:04,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:29:04,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:29:04,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:29:04,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-12-08 08:29:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:29:04,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:29:04,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2018-12-08 08:29:04,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-08 08:29:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-08 08:29:04,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=822, Unknown=11, NotChecked=0, Total=930 [2018-12-08 08:29:04,534 INFO L87 Difference]: Start difference. First operand 478 states and 635 transitions. Second operand 31 states. [2018-12-08 08:29:24,898 WARN L180 SmtUtils]: Spent 10.35 s on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2018-12-08 08:29:43,549 WARN L180 SmtUtils]: Spent 17.65 s on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2018-12-08 08:29:49,641 WARN L180 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-12-08 08:29:58,735 WARN L180 SmtUtils]: Spent 8.97 s on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2018-12-08 08:30:11,400 WARN L180 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2018-12-08 08:30:19,329 WARN L180 SmtUtils]: Spent 5.70 s on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2018-12-08 08:30:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:30:31,046 INFO L93 Difference]: Finished difference Result 841 states and 1132 transitions. [2018-12-08 08:30:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-08 08:30:31,046 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-12-08 08:30:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:30:31,048 INFO L225 Difference]: With dead ends: 841 [2018-12-08 08:30:31,048 INFO L226 Difference]: Without dead ends: 839 [2018-12-08 08:30:31,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 101.6s TimeCoverageRelationStatistics Valid=456, Invalid=2710, Unknown=26, NotChecked=0, Total=3192 [2018-12-08 08:30:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-08 08:30:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 382. [2018-12-08 08:30:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-08 08:30:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 510 transitions. [2018-12-08 08:30:31,139 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 510 transitions. Word has length 43 [2018-12-08 08:30:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:30:31,139 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 510 transitions. [2018-12-08 08:30:31,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-08 08:30:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 510 transitions. [2018-12-08 08:30:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 08:30:31,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:30:31,140 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:30:31,140 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:30:31,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:30:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 229619440, now seen corresponding path program 2 times [2018-12-08 08:30:31,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:30:31,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:30:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:31,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:30:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:30:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 08:30:31,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:30:31,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:30:31,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:30:31,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:30:31,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:30:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:30:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 08:30:31,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:30:31,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-08 08:30:31,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 08:30:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:30:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:30:31,283 INFO L87 Difference]: Start difference. First operand 382 states and 510 transitions. Second operand 13 states. [2018-12-08 08:30:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:30:31,613 INFO L93 Difference]: Finished difference Result 766 states and 1002 transitions. [2018-12-08 08:30:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 08:30:31,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-12-08 08:30:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:30:31,614 INFO L225 Difference]: With dead ends: 766 [2018-12-08 08:30:31,614 INFO L226 Difference]: Without dead ends: 584 [2018-12-08 08:30:31,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-12-08 08:30:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-12-08 08:30:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 401. [2018-12-08 08:30:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-08 08:30:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 523 transitions. [2018-12-08 08:30:31,720 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 523 transitions. Word has length 47 [2018-12-08 08:30:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:30:31,720 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 523 transitions. [2018-12-08 08:30:31,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 08:30:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 523 transitions. [2018-12-08 08:30:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 08:30:31,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:30:31,721 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:30:31,721 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:30:31,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:30:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2061264985, now seen corresponding path program 6 times [2018-12-08 08:30:31,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:30:31,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:30:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:31,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:30:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:30:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:30:31,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:30:31,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:30:31,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-08 08:30:31,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-08 08:30:31,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:30:31,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:30:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 08:30:31,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:30:31,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-12-08 08:30:31,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 08:30:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 08:30:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-08 08:30:31,891 INFO L87 Difference]: Start difference. First operand 401 states and 523 transitions. Second operand 16 states. [2018-12-08 08:30:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:30:32,400 INFO L93 Difference]: Finished difference Result 868 states and 1120 transitions. [2018-12-08 08:30:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 08:30:32,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-08 08:30:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:30:32,401 INFO L225 Difference]: With dead ends: 868 [2018-12-08 08:30:32,401 INFO L226 Difference]: Without dead ends: 831 [2018-12-08 08:30:32,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2018-12-08 08:30:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-08 08:30:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 529. [2018-12-08 08:30:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-08 08:30:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 704 transitions. [2018-12-08 08:30:32,544 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 704 transitions. Word has length 46 [2018-12-08 08:30:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:30:32,544 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 704 transitions. [2018-12-08 08:30:32,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 08:30:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 704 transitions. [2018-12-08 08:30:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 08:30:32,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:30:32,545 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:30:32,545 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:30:32,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:30:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1112882494, now seen corresponding path program 1 times [2018-12-08 08:30:32,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:30:32,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:30:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:32,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:30:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:30:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:30:33,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:30:33,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:30:33,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:30:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:30:33,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:30:33,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:30:33,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 44 [2018-12-08 08:30:33,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 08:30:33,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:65, output treesize:60 [2018-12-08 08:30:33,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2018-12-08 08:30:33,381 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 26 treesize of output 20 [2018-12-08 08:30:33,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:67 [2018-12-08 08:30:33,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 86 [2018-12-08 08:30:33,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,515 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 08:30:33,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:30:33,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:57 [2018-12-08 08:30:33,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2018-12-08 08:30:33,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:30:33,675 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 78 [2018-12-08 08:30:33,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 08:30:33,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-12-08 08:30:33,836 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 08:30:33,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:30:33,837 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-08 08:30:33,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:110, output treesize:1 [2018-12-08 08:30:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 08:30:33,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:30:33,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-12-08 08:30:33,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 08:30:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 08:30:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-12-08 08:30:33,859 INFO L87 Difference]: Start difference. First operand 529 states and 704 transitions. Second operand 26 states. [2018-12-08 08:30:35,685 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2018-12-08 08:30:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:30:37,207 INFO L93 Difference]: Finished difference Result 1276 states and 1693 transitions. [2018-12-08 08:30:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-08 08:30:37,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-12-08 08:30:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:30:37,209 INFO L225 Difference]: With dead ends: 1276 [2018-12-08 08:30:37,209 INFO L226 Difference]: Without dead ends: 1076 [2018-12-08 08:30:37,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=399, Invalid=2571, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 08:30:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-12-08 08:30:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 780. [2018-12-08 08:30:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-12-08 08:30:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1062 transitions. [2018-12-08 08:30:37,418 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1062 transitions. Word has length 48 [2018-12-08 08:30:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:30:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 1062 transitions. [2018-12-08 08:30:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 08:30:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1062 transitions. [2018-12-08 08:30:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 08:30:37,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:30:37,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:30:37,419 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:30:37,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:30:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 978868988, now seen corresponding path program 1 times [2018-12-08 08:30:37,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:30:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:30:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:37,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:30:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:30:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:30:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:30:37,466 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 08:30:37,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:30:37 BoogieIcfgContainer [2018-12-08 08:30:37,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 08:30:37,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:30:37,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:30:37,500 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:30:37,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:18:18" (3/4) ... [2018-12-08 08:30:37,502 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 08:30:37,537 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_657f38b2-3b97-434f-98ef-8aebc4ff71c8/bin-2019/uautomizer/witness.graphml [2018-12-08 08:30:37,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:30:37,537 INFO L168 Benchmark]: Toolchain (without parser) took 739438.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 960.3 MB in the beginning and 855.1 MB in the end (delta: 105.2 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 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-08 08:30:37,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 59.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -106.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 INFO L168 Benchmark]: RCFGBuilder took 190.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 INFO L168 Benchmark]: TraceAbstraction took 738993.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.0 GB in the beginning and 863.4 MB in the end (delta: 159.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,538 INFO L168 Benchmark]: Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 863.4 MB in the beginning and 855.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:30:37,539 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 148.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 59.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -106.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 738993.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.0 GB in the beginning and 863.4 MB in the end (delta: 159.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 863.4 MB in the beginning and 855.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int INFINITY = 899; VAL [\old(INFINITY)=906, INFINITY=899] [L13] int nodecount = __VERIFIER_nondet_int(); [L14] int edgecount = __VERIFIER_nondet_int(); [L15] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L16] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L17] int source = 0; [L18] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L19] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L20] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L21] int distance[5]; [L22] int x,y; [L23] int i,j; [L25] i = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L25] COND TRUE i < nodecount VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L26] COND TRUE i == source [L27] distance[i] = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={900:0}, source=0, Weight={903:0}] [L25] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L25] COND TRUE i < nodecount VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L26] COND FALSE !(i == source) [L30] distance[i] = INFINITY VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L25] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L25] COND FALSE !(i < nodecount) VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={900:0}, source=0, Weight={903:0}] [L34] i = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={900:0}, Weight={903:0}] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={900:0}, source=0, Weight={903:0}] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={904:0}, distance={901:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={900:0}, Weight={903:0}, Weight[j]=0, x=1, y=0] [L40] COND TRUE distance[x] > distance[y] + Weight[j] [L42] distance[x] = -1 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L36] j++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L34] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={904:0}, distance={901:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={900:0}, source=0, Weight={903:0}, Weight[j]=0, x=1, y=0] [L40] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L36] j++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L34] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L34] COND FALSE !(i < nodecount) VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L46] i = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L46] COND TRUE i < edgecount [L48] EXPR Dest[i] [L48] x = Dest[i] [L49] EXPR Source[i] [L49] y = Source[i] [L50] EXPR distance[x] [L50] EXPR distance[y] [L50] EXPR Weight[i] VAL [Dest={904:0}, distance={901:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, Weight[i]=0, x=1, y=0] [L50] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L46] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L46] COND FALSE !(i < edgecount) VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L56] i = 0 VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={904:0}, distance={901:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L6] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L58] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={904:0}, distance={901:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L56] i++ VAL [Dest={904:0}, distance={901:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={900:0}, source=0, Weight={903:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={904:0}, distance={901:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={900:0}, Weight={903:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 738.9s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 677.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1300 SDtfs, 4680 SDslu, 7864 SDs, 0 SdLazy, 14516 SolverSat, 3471 SolverUnsat, 127 SolverUnknown, 0 SolverNotchecked, 270.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1351 GetRequests, 602 SyntacticMatches, 27 SemanticMatches, 722 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23899 ImplicationChecksByTransitivity, 453.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=22, 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: 1.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 4732 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 59.0s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1546 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1463 ConstructedInterpolants, 96 QuantifiedInterpolants, 675799 SizeOfPredicates, 153 NumberOfNonLiveVariables, 4827 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 41 InterpolantComputations, 3 PerfectInterpolantSequences, 277/724 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...