./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:55:53,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:55:53,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:55:53,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:55:53,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:55:53,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:55:53,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:55:53,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:55:53,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:55:53,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:55:53,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:55:53,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:55:53,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:55:53,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:55:53,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:55:53,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:55:53,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:55:53,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:55:53,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:55:53,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:55:53,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:55:53,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:55:53,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:55:53,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:55:53,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:55:53,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:55:53,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:55:53,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:55:53,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:55:53,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:55:53,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:55:53,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:55:53,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:55:53,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:55:53,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:55:53,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:55:53,528 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 01:55:53,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:55:53,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:55:53,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:55:53,539 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 01:55:53,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:55:53,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:55:53,539 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:55:53,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:55:53,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:55:53,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:55:53,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:55:53,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:55:53,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:55:53,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:55:53,543 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_7d582bc8-0bbe-4664-978b-4ac9c0300159/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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-11-10 01:55:53,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:55:53,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:55:53,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:55:53,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:55:53,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:55:53,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-10 01:55:53,621 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/data/2e0924d81/185039df8a86451cb6b4c9e500979188/FLAGaf31e4955 [2018-11-10 01:55:54,034 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:55:54,035 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-10 01:55:54,040 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/data/2e0924d81/185039df8a86451cb6b4c9e500979188/FLAGaf31e4955 [2018-11-10 01:55:54,051 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/data/2e0924d81/185039df8a86451cb6b4c9e500979188 [2018-11-10 01:55:54,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:55:54,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:55:54,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:55:54,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:55:54,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:55:54,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc8502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54, skipping insertion in model container [2018-11-10 01:55:54,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:55:54,084 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:55:54,203 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:55:54,209 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:55:54,222 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:55:54,232 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:55:54,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54 WrapperNode [2018-11-10 01:55:54,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:55:54,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:55:54,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:55:54,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:55:54,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... [2018-11-10 01:55:54,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:55:54,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:55:54,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:55:54,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:55:54,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:55:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:55:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:55:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 01:55:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:55:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 01:55:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 01:55:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:55:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:55:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 01:55:54,485 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:55:54,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:55:54 BoogieIcfgContainer [2018-11-10 01:55:54,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:55:54,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:55:54,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:55:54,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:55:54,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:55:54" (1/3) ... [2018-11-10 01:55:54,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616bcc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:54, skipping insertion in model container [2018-11-10 01:55:54,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:54" (2/3) ... [2018-11-10 01:55:54,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616bcc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:54, skipping insertion in model container [2018-11-10 01:55:54,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:55:54" (3/3) ... [2018-11-10 01:55:54,491 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-10 01:55:54,500 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:55:54,506 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:55:54,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:55:54,538 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:55:54,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:55:54,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:55:54,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:55:54,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:55:54,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:55:54,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:55:54,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:55:54,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:55:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 01:55:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 01:55:54,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:54,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:54,558 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:54,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash 612174076, now seen corresponding path program 1 times [2018-11-10 01:55:54,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:54,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:55:54,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:55:54,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:55:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:55:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:55:54,670 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-10 01:55:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:54,684 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-10 01:55:54,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:55:54,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-10 01:55:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:54,690 INFO L225 Difference]: With dead ends: 83 [2018-11-10 01:55:54,690 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 01:55:54,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:55:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 01:55:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-10 01:55:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 01:55:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-10 01:55:54,717 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2018-11-10 01:55:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:54,717 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-10 01:55:54,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:55:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-10 01:55:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 01:55:54,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:54,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:54,718 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:54,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 680014012, now seen corresponding path program 1 times [2018-11-10 01:55:54,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:54,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:54,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:54,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:55:54,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:55:54,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:55:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:55:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:55:54,772 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2018-11-10 01:55:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:54,800 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-10 01:55:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:55:54,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 01:55:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:54,801 INFO L225 Difference]: With dead ends: 68 [2018-11-10 01:55:54,801 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 01:55:54,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:55:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 01:55:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-10 01:55:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 01:55:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-10 01:55:54,806 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 32 [2018-11-10 01:55:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:54,806 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-10 01:55:54,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:55:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-10 01:55:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 01:55:54,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:54,807 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:54,807 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:54,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 746290864, now seen corresponding path program 1 times [2018-11-10 01:55:54,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:54,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:54,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:54,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:54,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:54,872 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:54,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:54,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:54,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:54,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 01:55:54,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:55:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:55:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:55:54,960 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 5 states. [2018-11-10 01:55:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:54,994 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-10 01:55:54,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:55:54,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 01:55:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:54,996 INFO L225 Difference]: With dead ends: 75 [2018-11-10 01:55:54,996 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 01:55:54,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:55:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 01:55:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-11-10 01:55:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 01:55:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-10 01:55:55,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 39 [2018-11-10 01:55:55,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:55,000 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-10 01:55:55,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:55:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-10 01:55:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 01:55:55,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:55,001 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:55,001 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:55,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:55,002 INFO L82 PathProgramCache]: Analyzing trace with hash 507926076, now seen corresponding path program 2 times [2018-11-10 01:55:55,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:55,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:55,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:55,061 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:55:55,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 01:55:55,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:55,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:55,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:55:55,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:55:55,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:55:55,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:55:55,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 01:55:55,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:55:55,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:55:55,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 01:55:55,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 01:55:55,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-11-10 01:55:55,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:55:55,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 01:55:55,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:55,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 01:55:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 01:55:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:55:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 01:55:55,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:55:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:55:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:55:55,303 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 12 states. [2018-11-10 01:55:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:55,450 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-10 01:55:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:55:55,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-10 01:55:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:55,453 INFO L225 Difference]: With dead ends: 85 [2018-11-10 01:55:55,453 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 01:55:55,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:55:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 01:55:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-11-10 01:55:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 01:55:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 01:55:55,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-10 01:55:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:55,459 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 01:55:55,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:55:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-10 01:55:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 01:55:55,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:55,461 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:55,461 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:55,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1628843076, now seen corresponding path program 1 times [2018-11-10 01:55:55,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:55:55,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:55,528 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:55,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:55:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:55,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 01:55:55,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:55:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:55:55,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:55:55,611 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 7 states. [2018-11-10 01:55:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:55,639 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-10 01:55:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:55:55,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-10 01:55:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:55,640 INFO L225 Difference]: With dead ends: 95 [2018-11-10 01:55:55,640 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 01:55:55,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:55:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 01:55:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-11-10 01:55:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 01:55:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-10 01:55:55,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 56 [2018-11-10 01:55:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:55,644 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 01:55:55,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:55:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-10 01:55:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 01:55:55,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:55,645 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:55,645 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:55,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1057981872, now seen corresponding path program 2 times [2018-11-10 01:55:55,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:55,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:55:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:55,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:55:55,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:55:55,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:55,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:55:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 01:55:55,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:55:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:55:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:55:55,821 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 8 states. [2018-11-10 01:55:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:55,853 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-10 01:55:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:55:55,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-10 01:55:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:55,858 INFO L225 Difference]: With dead ends: 102 [2018-11-10 01:55:55,858 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 01:55:55,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:55:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 01:55:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-10 01:55:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 01:55:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-11-10 01:55:55,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 63 [2018-11-10 01:55:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:55,862 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-10 01:55:55,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:55:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-10 01:55:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 01:55:55,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:55,863 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:55,864 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:55,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -839943876, now seen corresponding path program 3 times [2018-11-10 01:55:55,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:55:55,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:55,940 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:55:55,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 01:55:55,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:55,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:56,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 01:55:56,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 01:55:56,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 01:55:56,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:55:56,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:55:56,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:55:56,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:55:56,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 01:55:56,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:55:56,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:55:56,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 01:55:56,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 01:55:56,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-10 01:55:56,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:55:56,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 01:55:56,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 01:55:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 01:55:56,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:56,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-10 01:55:56,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:55:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:55:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:55:56,163 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 15 states. [2018-11-10 01:55:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:56,319 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-11-10 01:55:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:55:56,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-10 01:55:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:56,320 INFO L225 Difference]: With dead ends: 112 [2018-11-10 01:55:56,320 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 01:55:56,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:55:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 01:55:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-11-10 01:55:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 01:55:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-10 01:55:56,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 70 [2018-11-10 01:55:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:56,325 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-10 01:55:56,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:55:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-10 01:55:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 01:55:56,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:56,326 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:56,326 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:56,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2095836348, now seen corresponding path program 4 times [2018-11-10 01:55:56,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:56,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:56,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:56,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 01:55:56,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:56,401 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:56,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 01:55:56,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 01:55:56,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:56,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 01:55:56,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 01:55:56,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 01:55:56,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:55:56,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:55:56,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:55:56,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:55:56,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 01:55:56,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:55:56,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:55:56,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 01:55:56,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 01:55:56,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-11-10 01:55:56,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:55:56,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 01:55:56,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:56,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 01:55:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 01:55:56,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:56,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-11-10 01:55:56,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 01:55:56,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 01:55:56,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:55:56,634 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-11-10 01:55:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:56,749 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-11-10 01:55:56,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 01:55:56,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-11-10 01:55:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:56,750 INFO L225 Difference]: With dead ends: 125 [2018-11-10 01:55:56,750 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 01:55:56,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:55:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 01:55:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-10 01:55:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 01:55:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-11-10 01:55:56,755 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 80 [2018-11-10 01:55:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:56,755 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-10 01:55:56,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 01:55:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-10 01:55:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 01:55:56,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:56,756 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:56,756 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:56,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 136415804, now seen corresponding path program 5 times [2018-11-10 01:55:56,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:56,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 01:55:56,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:56,832 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 01:55:56,921 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-10 01:55:56,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:56,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 01:55:56,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:56,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 01:55:56,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:55:56,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:55:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:55:56,962 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 11 states. [2018-11-10 01:55:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:56,997 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-10 01:55:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:55:56,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-11-10 01:55:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:56,999 INFO L225 Difference]: With dead ends: 135 [2018-11-10 01:55:56,999 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 01:55:56,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:55:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 01:55:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-10 01:55:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 01:55:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-11-10 01:55:57,003 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 90 [2018-11-10 01:55:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:57,004 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-11-10 01:55:57,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:55:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-11-10 01:55:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 01:55:57,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:57,005 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:57,005 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:57,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1110556464, now seen corresponding path program 6 times [2018-11-10 01:55:57,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:57,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 01:55:57,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:57,086 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:57,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 01:55:57,242 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 01:55:57,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:57,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:57,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 01:55:57,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 01:55:57,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 01:55:57,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:55:57,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:55:57,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:55:57,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:55:57,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 01:55:57,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:55:57,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:55:57,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 01:55:57,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 01:55:57,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-10 01:55:57,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:55:57,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 01:55:57,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:57,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 01:55:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-10 01:55:57,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:57,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-10 01:55:57,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 01:55:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 01:55:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:55:57,426 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 20 states. [2018-11-10 01:55:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:57,623 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-11-10 01:55:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 01:55:57,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-10 01:55:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:57,624 INFO L225 Difference]: With dead ends: 145 [2018-11-10 01:55:57,624 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 01:55:57,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-11-10 01:55:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 01:55:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-11-10 01:55:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 01:55:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-10 01:55:57,629 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2018-11-10 01:55:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:57,629 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-10 01:55:57,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 01:55:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-10 01:55:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 01:55:57,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:57,631 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:57,631 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:57,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1498279504, now seen corresponding path program 7 times [2018-11-10 01:55:57,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:55:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 01:55:57,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:57,742 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:57,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:57,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 01:55:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 01:55:57,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:55:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:55:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:55:57,817 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 13 states. [2018-11-10 01:55:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:55:57,863 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-11-10 01:55:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:55:57,864 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2018-11-10 01:55:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:55:57,864 INFO L225 Difference]: With dead ends: 150 [2018-11-10 01:55:57,864 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 01:55:57,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:55:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 01:55:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 01:55:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 01:55:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-11-10 01:55:57,870 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 107 [2018-11-10 01:55:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:55:57,871 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-11-10 01:55:57,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:55:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-11-10 01:55:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 01:55:57,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:55:57,872 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:55:57,872 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:55:57,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:55:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -878976196, now seen corresponding path program 8 times [2018-11-10 01:55:57,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:55:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:55:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:55:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:55:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:55:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-10 01:55:58,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:55:58,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:55:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:55:58,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:55:58,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:55:58,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:55:58,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 01:55:58,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 01:55:58,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2018-11-10 01:55:58,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:55:58,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:55:58,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:55:58,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:55:58,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-11-10 01:55:58,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:55:58,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:55:58,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:58,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2018-11-10 01:55:59,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-10 01:55:59,102 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:55:59,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 01:55:59,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:55:59,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:55:59,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:55:59,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-11-10 01:55:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:55:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:55:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 39 [2018-11-10 01:55:59,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 01:55:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 01:55:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 01:55:59,193 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 39 states. [2018-11-10 01:56:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:56:00,329 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-11-10 01:56:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 01:56:00,330 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 114 [2018-11-10 01:56:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:56:00,330 INFO L225 Difference]: With dead ends: 146 [2018-11-10 01:56:00,330 INFO L226 Difference]: Without dead ends: 135 [2018-11-10 01:56:00,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=3101, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 01:56:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-10 01:56:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-11-10 01:56:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 01:56:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-11-10 01:56:00,337 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 114 [2018-11-10 01:56:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:56:00,337 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-11-10 01:56:00,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 01:56:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-11-10 01:56:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 01:56:00,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:56:00,338 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:56:00,339 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:56:00,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1850947376, now seen corresponding path program 9 times [2018-11-10 01:56:00,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:00,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:00,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:00,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:56:00,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:56:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-11-10 01:56:00,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:56:00,917 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/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-11-10 01:56:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:56:01,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 01:56:01,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:56:01,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:56:01,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 01:56:01,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 01:56:01,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2018-11-10 01:56:01,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:56:01,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:56:01,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 01:56:01,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 01:56:01,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-10 01:56:01,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:56:01,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:56:01,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 01:56:01,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 01:56:01,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-10 01:56:01,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:56:01,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 01:56:01,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:56:01,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 01:56:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-11-10 01:56:01,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:56:01,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 25 [2018-11-10 01:56:01,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 01:56:01,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 01:56:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:56:01,339 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 25 states. [2018-11-10 01:56:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:56:01,693 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-11-10 01:56:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 01:56:01,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2018-11-10 01:56:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:56:01,694 INFO L225 Difference]: With dead ends: 144 [2018-11-10 01:56:01,694 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 01:56:01,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=485, Invalid=1771, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 01:56:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 01:56:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 01:56:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 01:56:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-11-10 01:56:01,699 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2018-11-10 01:56:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:56:01,699 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-11-10 01:56:01,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 01:56:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-11-10 01:56:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 01:56:01,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:56:01,700 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:56:01,701 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:56:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:56:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -316406340, now seen corresponding path program 10 times [2018-11-10 01:56:01,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:56:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:56:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:01,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:56:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:56:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:56:01,812 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:56:01,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:56:01 BoogieIcfgContainer [2018-11-10 01:56:01,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:56:01,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:56:01,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:56:01,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:56:01,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:55:54" (3/4) ... [2018-11-10 01:56:01,863 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:56:01,913 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7d582bc8-0bbe-4664-978b-4ac9c0300159/bin-2019/uautomizer/witness.graphml [2018-11-10 01:56:01,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:56:01,914 INFO L168 Benchmark]: Toolchain (without parser) took 7860.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 240.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,915 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:56:01,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.84 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,916 INFO L168 Benchmark]: Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,916 INFO L168 Benchmark]: RCFGBuilder took 225.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,916 INFO L168 Benchmark]: TraceAbstraction took 7370.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 66.8 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,916 INFO L168 Benchmark]: Witness Printer took 56.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:56:01,919 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.84 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7370.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 66.8 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. * Witness Printer took 56.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] FCALL struct cont cont; VAL [cont={82:0}] [L20] FCALL struct dummy array[10]; VAL [array={83:0}, cont={82:0}] [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={83:0}, cont={82:0}, i=8, j=0] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=0] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=0] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=1] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=1] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=1] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=2] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=2] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=2] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=3] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=3] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=3] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=4] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=4] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=4] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=5] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=5] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=5] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=6] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=6] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=6] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=7] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=7] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=7] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=8] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=8] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, array={83:0}, cont={82:0}, i=8, j=8] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=9] [L24] COND TRUE j < 10 [L25] FCALL array[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=9] [L26] FCALL array[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, array={83:0}, cont={82:0}, i=8, j=9] [L24] j++ VAL [array={83:0}, cont={82:0}, i=8, j=10] [L24] COND FALSE !(j < 10) VAL [array={83:0}, cont={82:0}, i=8, j=10] [L29] COND TRUE i >= 0 && i < 9 VAL [array={83:0}, cont={82:0}, i=8, j=10] [L30] FCALL cont.array = &array[i] VAL [array={83:0}, cont={82:0}, i=8, j=10] [L31] EXPR, FCALL cont.array VAL [array={83:0}, cont={82:0}, cont.array={83:64}, i=8, j=10] [L31] pa = &cont.array[0].b [L32] EXPR, FCALL cont.array VAL [array={83:0}, cont={82:0}, cont.array={83:64}, i=8, j=10, pa={83:68}] [L32] EXPR, FCALL cont.array[0].b VAL [array={83:0}, cont={82:0}, cont.array={83:64}, cont.array[0].b=1, i=8, j=10, pa={83:68}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR, FCALL array[i].b VAL [array={83:0}, array[i].b=1, cont={82:0}, i=8, j=10, pa={83:68}] [L33] i = array[i].b - 10 [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-9, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-8, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-8, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-7, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-7, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-6, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-6, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-5, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-5, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-4, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-4, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-3, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-3, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-2, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-2, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=-1, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=-1, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=0, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=0, j=10, pa={83:68}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={83:0}, cont={82:0}, i=1, j=10, pa={83:68}] [L34] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, array={83:0}, cont={82:0}, i=1, j=10, pa={83:68}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={82:0}] [L14] EXPR, FCALL pc->array VAL [\old(i)=1, i=1, pc={82:0}, pc={82:0}, pc->array={83:64}] [L14] EXPR, FCALL pc->array[1].b VAL [\old(i)=1, i=1, pc={82:0}, pc={82:0}, pc->array={83:64}, pc->array[1].b=0] [L14] RET return pc->array[1].b == i; [L37] EXPR check(&cont, i) VAL [array={83:0}, check(&cont, i)=0, cont={82:0}, i=1, j=10, pa={83:68}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={83:0}, cont={82:0}, i=1, j=10, pa={83:68}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. UNSAFE Result, 7.3s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 452 SDtfs, 571 SDslu, 3312 SDs, 0 SdLazy, 2558 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 870 SyntacticMatches, 3 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 50 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1819 ConstructedInterpolants, 16 QuantifiedInterpolants, 606572 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1947 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 1350/3698 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...