./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:26:29,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:26:29,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:26:29,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:26:29,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:26:29,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:26:29,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:26:29,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:26:29,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:26:29,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:26:29,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:26:29,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:26:29,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:26:29,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:26:29,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:26:29,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:26:29,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:26:29,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:26:29,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:26:29,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:26:29,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:26:29,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:26:29,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:26:29,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:26:29,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:26:29,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:26:29,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:26:29,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:26:29,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:26:29,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:26:29,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:26:29,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:26:29,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:26:29,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:26:29,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:26:29,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:26:29,628 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 15:26:29,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:26:29,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:26:29,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:26:29,639 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 15:26:29,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:26:29,640 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:26:29,640 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:26:29,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:26:29,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:26:29,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:26:29,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:26:29,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:26:29,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:26:29,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:26:29,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:26:29,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:26:29,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:26:29,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:26:29,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:26:29,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:26:29,643 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:26:29,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:26:29,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:26:29,643 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_659f4d0f-860b-47cf-8e05-5fc9f174f834/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-11-18 15:26:29,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:26:29,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:26:29,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:26:29,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:26:29,678 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:26:29,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 15:26:29,716 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/data/02204b1f1/7105a09ef935426eb7dc20332a4a1cbd/FLAG026db0788 [2018-11-18 15:26:30,121 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:26:30,121 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 15:26:30,130 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/data/02204b1f1/7105a09ef935426eb7dc20332a4a1cbd/FLAG026db0788 [2018-11-18 15:26:30,486 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/data/02204b1f1/7105a09ef935426eb7dc20332a4a1cbd [2018-11-18 15:26:30,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:26:30,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 15:26:30,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:26:30,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:26:30,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:26:30,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0e305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30, skipping insertion in model container [2018-11-18 15:26:30,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:26:30,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:26:30,747 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:26:30,751 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:26:30,803 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:26:30,812 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:26:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30 WrapperNode [2018-11-18 15:26:30,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:26:30,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:26:30,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:26:30,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:26:30,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... [2018-11-18 15:26:30,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:26:30,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:26:30,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:26:30,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:26:30,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:26:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:26:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:26:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:26:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 15:26:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 15:26:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:26:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:26:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:26:31,559 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:26:31,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:26:31 BoogieIcfgContainer [2018-11-18 15:26:31,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:26:31,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:26:31,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:26:31,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:26:31,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:26:30" (1/3) ... [2018-11-18 15:26:31,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67011ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:26:31, skipping insertion in model container [2018-11-18 15:26:31,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:26:30" (2/3) ... [2018-11-18 15:26:31,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67011ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:26:31, skipping insertion in model container [2018-11-18 15:26:31,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:26:31" (3/3) ... [2018-11-18 15:26:31,568 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 15:26:31,575 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:26:31,580 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:26:31,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:26:31,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:26:31,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:26:31,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:26:31,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:26:31,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:26:31,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:26:31,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:26:31,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:26:31,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:26:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-18 15:26:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 15:26:31,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:31,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:31,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:31,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-18 15:26:31,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:31,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:31,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:31,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:31,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:31,749 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-18 15:26:31,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:31,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:26:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:26:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:26:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:26:31,769 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-18 15:26:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:31,789 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-18 15:26:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:26:31,790 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 15:26:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:31,798 INFO L225 Difference]: With dead ends: 222 [2018-11-18 15:26:31,798 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 15:26:31,801 INFO L604 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-18 15:26:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 15:26:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-18 15:26:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 15:26:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-18 15:26:31,833 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-18 15:26:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:31,834 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-18 15:26:31,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:26:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-18 15:26:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 15:26:31,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:31,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:31,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:31,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-18 15:26:31,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:31,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:31,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:31,883 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-18 15:26:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:31,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:31,885 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-18 15:26:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:31,951 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-18 15:26:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:31,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 15:26:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:31,953 INFO L225 Difference]: With dead ends: 205 [2018-11-18 15:26:31,953 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 15:26:31,955 INFO L604 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-18 15:26:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 15:26:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-18 15:26:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 15:26:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-18 15:26:31,962 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-18 15:26:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:31,963 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-18 15:26:31,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-18 15:26:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 15:26:31,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:31,964 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:31,964 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:31,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-18 15:26:31,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:31,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:31,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:32,201 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2018-11-18 15:26:32,604 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-11-18 15:26:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:32,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:32,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:26:32,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:26:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:26:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:26:32,609 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-11-18 15:26:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:32,822 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-18 15:26:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:32,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-18 15:26:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:32,824 INFO L225 Difference]: With dead ends: 209 [2018-11-18 15:26:32,824 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 15:26:32,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:26:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 15:26:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-18 15:26:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 15:26:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-18 15:26:32,836 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-18 15:26:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:32,836 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-18 15:26:32,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:26:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-18 15:26:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 15:26:32,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:32,837 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:32,838 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:32,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-18 15:26:32,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:32,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:32,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:32,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:32,868 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-18 15:26:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:32,909 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-18 15:26:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:32,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 15:26:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:32,910 INFO L225 Difference]: With dead ends: 297 [2018-11-18 15:26:32,910 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 15:26:32,911 INFO L604 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-18 15:26:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 15:26:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-18 15:26:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 15:26:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-18 15:26:32,917 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-18 15:26:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:32,918 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-18 15:26:32,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-18 15:26:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 15:26:32,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:32,919 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:32,919 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:32,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-18 15:26:32,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:32,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:26:32,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:32,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:32,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:32,959 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-18 15:26:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:32,994 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-18 15:26:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:32,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 15:26:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:32,995 INFO L225 Difference]: With dead ends: 230 [2018-11-18 15:26:32,995 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 15:26:32,995 INFO L604 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-18 15:26:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 15:26:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-18 15:26:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 15:26:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-18 15:26:33,000 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-18 15:26:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:33,000 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-18 15:26:33,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-18 15:26:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 15:26:33,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:33,001 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:33,001 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:33,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:33,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-18 15:26:33,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:33,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:33,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:33,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:33,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:33,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:33,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:33,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:33,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-18 15:26:33,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:26:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:26:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:26:33,181 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-18 15:26:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:33,305 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-18 15:26:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:26:33,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 15:26:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:33,307 INFO L225 Difference]: With dead ends: 192 [2018-11-18 15:26:33,307 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 15:26:33,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:26:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 15:26:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-18 15:26:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 15:26:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-18 15:26:33,316 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-18 15:26:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:33,317 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-18 15:26:33,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:26:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-18 15:26:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 15:26:33,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:33,318 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:33,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:33,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-11-18 15:26:33,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:33,557 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2018-11-18 15:26:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:33,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:33,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:33,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:33,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:33,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:33,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-18 15:26:33,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:26:33,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:26:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:26:33,639 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 5 states. [2018-11-18 15:26:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:33,751 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-18 15:26:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:26:33,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 15:26:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:33,753 INFO L225 Difference]: With dead ends: 230 [2018-11-18 15:26:33,753 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 15:26:33,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:26:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 15:26:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-18 15:26:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 15:26:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-18 15:26:33,762 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-18 15:26:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:33,763 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-18 15:26:33,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:26:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-18 15:26:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:26:33,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:33,765 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:33,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:33,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-11-18 15:26:33,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:33,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:26:33,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:33,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:33,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:33,791 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-18 15:26:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:33,818 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-18 15:26:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:33,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 15:26:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:33,819 INFO L225 Difference]: With dead ends: 391 [2018-11-18 15:26:33,819 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 15:26:33,820 INFO L604 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-18 15:26:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 15:26:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-18 15:26:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 15:26:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-18 15:26:33,824 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-18 15:26:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:33,824 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-18 15:26:33,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-18 15:26:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:26:33,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:33,825 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:26:33,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:33,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-18 15:26:33,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:33,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:34,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:34,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:26:34,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:26:34,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 15:26:34,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:26:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:26:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:26:34,089 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 6 states. [2018-11-18 15:26:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:34,206 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2018-11-18 15:26:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:26:34,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-18 15:26:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:34,208 INFO L225 Difference]: With dead ends: 357 [2018-11-18 15:26:34,208 INFO L226 Difference]: Without dead ends: 341 [2018-11-18 15:26:34,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:26:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-18 15:26:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 312. [2018-11-18 15:26:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-18 15:26:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 471 transitions. [2018-11-18 15:26:34,219 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 471 transitions. Word has length 31 [2018-11-18 15:26:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:34,220 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 471 transitions. [2018-11-18 15:26:34,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:26:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 471 transitions. [2018-11-18 15:26:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 15:26:34,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:34,221 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 15:26:34,221 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:34,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:34,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1174866170, now seen corresponding path program 1 times [2018-11-18 15:26:34,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:26:34,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:34,257 INFO L87 Difference]: Start difference. First operand 312 states and 471 transitions. Second operand 3 states. [2018-11-18 15:26:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:34,285 INFO L93 Difference]: Finished difference Result 512 states and 778 transitions. [2018-11-18 15:26:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:34,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 15:26:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:34,287 INFO L225 Difference]: With dead ends: 512 [2018-11-18 15:26:34,288 INFO L226 Difference]: Without dead ends: 246 [2018-11-18 15:26:34,289 INFO L604 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-18 15:26:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-18 15:26:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-11-18 15:26:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 15:26:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-18 15:26:34,296 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-18 15:26:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:34,296 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-18 15:26:34,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-18 15:26:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 15:26:34,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:34,297 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 15:26:34,297 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:34,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-18 15:26:34,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:34,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:34,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:34,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:34,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-18 15:26:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:26:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:26:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:26:34,672 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 8 states. [2018-11-18 15:26:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:34,787 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-18 15:26:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:26:34,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-18 15:26:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:34,789 INFO L225 Difference]: With dead ends: 254 [2018-11-18 15:26:34,789 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 15:26:34,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:26:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 15:26:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-18 15:26:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 15:26:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-18 15:26:34,794 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-18 15:26:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:34,794 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-18 15:26:34,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:26:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-18 15:26:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 15:26:34,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:34,795 INFO L375 BasicCegarLoop]: trace histogram [4, 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-18 15:26:34,795 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:34,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-18 15:26:34,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:34,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:26:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:34,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:34,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:34,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:34,815 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-18 15:26:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:34,837 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-18 15:26:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:34,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 15:26:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:34,839 INFO L225 Difference]: With dead ends: 428 [2018-11-18 15:26:34,839 INFO L226 Difference]: Without dead ends: 229 [2018-11-18 15:26:34,839 INFO L604 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-18 15:26:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-18 15:26:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-18 15:26:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-18 15:26:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-18 15:26:34,845 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-18 15:26:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:34,845 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-18 15:26:34,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-18 15:26:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:26:34,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:34,846 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:34,846 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:34,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:34,846 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-18 15:26:34,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:34,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:34,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:26:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:26:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:26:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:26:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:26:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:26:34,875 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-18 15:26:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:34,909 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-18 15:26:34,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:26:34,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 15:26:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:34,910 INFO L225 Difference]: With dead ends: 309 [2018-11-18 15:26:34,910 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 15:26:34,911 INFO L604 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-18 15:26:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 15:26:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-18 15:26:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 15:26:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-18 15:26:34,915 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-18 15:26:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:34,915 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-18 15:26:34,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:26:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-18 15:26:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:26:34,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:34,916 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:34,916 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:34,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-18 15:26:34,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:34,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:26:34,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:34,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:35,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:35,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:35,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:35,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-18 15:26:35,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:26:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:26:35,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:26:35,106 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-18 15:26:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:35,157 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2018-11-18 15:26:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:26:35,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-18 15:26:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:35,159 INFO L225 Difference]: With dead ends: 190 [2018-11-18 15:26:35,159 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 15:26:35,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:26:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 15:26:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-11-18 15:26:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 15:26:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2018-11-18 15:26:35,164 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 51 [2018-11-18 15:26:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:35,164 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2018-11-18 15:26:35,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:26:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2018-11-18 15:26:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:26:35,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:35,165 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:35,165 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:35,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash 412447638, now seen corresponding path program 1 times [2018-11-18 15:26:35,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:35,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:35,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:35,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:35,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:35,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-18 15:26:35,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:26:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:26:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:26:35,647 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 9 states. [2018-11-18 15:26:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:35,837 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-11-18 15:26:35,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:26:35,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 15:26:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:35,839 INFO L225 Difference]: With dead ends: 194 [2018-11-18 15:26:35,839 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 15:26:35,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:26:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 15:26:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-11-18 15:26:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 15:26:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-18 15:26:35,845 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 55 [2018-11-18 15:26:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:35,845 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-18 15:26:35,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:26:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-18 15:26:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 15:26:35,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:35,846 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:35,846 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:35,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-18 15:26:35,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:40,237 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-11-18 15:26:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:40,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:40,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:40,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:40,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:40,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-18 15:26:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:26:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:26:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:26:40,446 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 11 states. [2018-11-18 15:26:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:40,868 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-11-18 15:26:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:26:40,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-11-18 15:26:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:40,870 INFO L225 Difference]: With dead ends: 187 [2018-11-18 15:26:40,870 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 15:26:40,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:26:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 15:26:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-11-18 15:26:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 15:26:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-18 15:26:40,876 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-18 15:26:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:40,876 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-18 15:26:40,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:26:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-18 15:26:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 15:26:40,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:40,876 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:40,876 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:40,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-18 15:26:40,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:41,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:41,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:41,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:41,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:41,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:41,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-18 15:26:41,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:26:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:26:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:26:41,292 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 9 states. [2018-11-18 15:26:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:41,381 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-18 15:26:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:26:41,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-11-18 15:26:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:41,382 INFO L225 Difference]: With dead ends: 203 [2018-11-18 15:26:41,382 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 15:26:41,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:26:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 15:26:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-18 15:26:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 15:26:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-18 15:26:41,389 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-18 15:26:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:41,390 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-18 15:26:41,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:26:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-18 15:26:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 15:26:41,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:41,391 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:41,391 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:41,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-18 15:26:41,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:41,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:26:41,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:41,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:41,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:41,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:26:41,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:41,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 15:26:41,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:26:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:26:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:26:41,662 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-18 15:26:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:41,715 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-18 15:26:41,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:26:41,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-18 15:26:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:41,717 INFO L225 Difference]: With dead ends: 224 [2018-11-18 15:26:41,717 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 15:26:41,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:26:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 15:26:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-18 15:26:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-18 15:26:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-18 15:26:41,723 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-18 15:26:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:41,723 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-18 15:26:41,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:26:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-18 15:26:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 15:26:41,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:41,724 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:41,724 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:41,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-18 15:26:41,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:41,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:41,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:44,069 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-11-18 15:26:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:44,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:44,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:44,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:44,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 15:26:44,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:26:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:26:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:26:44,226 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 11 states. [2018-11-18 15:26:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:44,410 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-18 15:26:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:26:44,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-18 15:26:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:44,412 INFO L225 Difference]: With dead ends: 221 [2018-11-18 15:26:44,412 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 15:26:44,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:26:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 15:26:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-18 15:26:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-18 15:26:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-18 15:26:44,421 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-18 15:26:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:44,421 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-18 15:26:44,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:26:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-18 15:26:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:26:44,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:44,422 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:44,422 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:44,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-18 15:26:44,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:44,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:26:44,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:44,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/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-18 15:26:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:44,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:44,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:44,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-18 15:26:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:26:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:26:44,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:26:44,809 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-18 15:26:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:44,966 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2018-11-18 15:26:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:26:44,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-18 15:26:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:44,968 INFO L225 Difference]: With dead ends: 264 [2018-11-18 15:26:44,968 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 15:26:44,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:26:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 15:26:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-11-18 15:26:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 15:26:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2018-11-18 15:26:44,975 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 93 [2018-11-18 15:26:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:44,975 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2018-11-18 15:26:44,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:26:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2018-11-18 15:26:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 15:26:44,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:44,976 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:44,977 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:44,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:44,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1152837687, now seen corresponding path program 1 times [2018-11-18 15:26:44,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:44,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:44,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 20 proven. 134 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:26:45,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:45,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:45,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:45,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-18 15:26:45,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 15:26:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 15:26:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:26:45,501 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 20 states. [2018-11-18 15:26:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:45,774 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2018-11-18 15:26:45,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:26:45,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-18 15:26:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:45,776 INFO L225 Difference]: With dead ends: 270 [2018-11-18 15:26:45,776 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 15:26:45,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-11-18 15:26:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 15:26:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2018-11-18 15:26:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 15:26:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-18 15:26:45,788 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 97 [2018-11-18 15:26:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:45,788 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-18 15:26:45,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 15:26:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-18 15:26:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 15:26:45,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:45,791 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:45,791 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:45,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-18 15:26:45,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:45,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:26:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:46,543 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-18 15:26:46,744 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-18 15:26:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:46,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:46,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:46,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:46,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:46,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:46,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:46,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 14 [2018-11-18 15:26:46,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 15:26:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:26:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:26:46,903 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 14 states. [2018-11-18 15:26:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:47,261 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-11-18 15:26:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 15:26:47,261 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-18 15:26:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:47,263 INFO L225 Difference]: With dead ends: 265 [2018-11-18 15:26:47,263 INFO L226 Difference]: Without dead ends: 263 [2018-11-18 15:26:47,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:26:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-18 15:26:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2018-11-18 15:26:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-18 15:26:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2018-11-18 15:26:47,278 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 103 [2018-11-18 15:26:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:47,279 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2018-11-18 15:26:47,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 15:26:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2018-11-18 15:26:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 15:26:47,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:47,280 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:47,281 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:47,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash -582642674, now seen corresponding path program 2 times [2018-11-18 15:26:47,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:47,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:47,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:47,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:47,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:47,743 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2018-11-18 15:26:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:26:47,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:47,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:47,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:47,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:47,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-11-18 15:26:47,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 15:26:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 15:26:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:26:47,977 INFO L87 Difference]: Start difference. First operand 256 states and 358 transitions. Second operand 22 states. [2018-11-18 15:26:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:48,205 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2018-11-18 15:26:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:26:48,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2018-11-18 15:26:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:48,207 INFO L225 Difference]: With dead ends: 277 [2018-11-18 15:26:48,207 INFO L226 Difference]: Without dead ends: 274 [2018-11-18 15:26:48,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:26:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-18 15:26:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-11-18 15:26:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-18 15:26:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2018-11-18 15:26:48,214 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 112 [2018-11-18 15:26:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2018-11-18 15:26:48,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 15:26:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2018-11-18 15:26:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:26:48,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:48,215 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:48,216 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:48,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash -498500945, now seen corresponding path program 2 times [2018-11-18 15:26:48,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:48,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:48,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 15:26:48,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:48,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:48,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:48,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:48,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 253 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:26:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-11-18 15:26:48,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:26:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:26:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:26:48,518 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand 11 states. [2018-11-18 15:26:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:48,617 INFO L93 Difference]: Finished difference Result 298 states and 414 transitions. [2018-11-18 15:26:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:26:48,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2018-11-18 15:26:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:48,619 INFO L225 Difference]: With dead ends: 298 [2018-11-18 15:26:48,619 INFO L226 Difference]: Without dead ends: 295 [2018-11-18 15:26:48,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:26:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-18 15:26:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-11-18 15:26:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-18 15:26:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2018-11-18 15:26:48,626 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 121 [2018-11-18 15:26:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:48,627 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2018-11-18 15:26:48,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:26:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2018-11-18 15:26:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 15:26:48,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:48,628 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:48,628 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:48,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash -363229152, now seen corresponding path program 2 times [2018-11-18 15:26:48,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:48,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:53,060 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 159 DAG size of output: 37 [2018-11-18 15:26:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:53,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:53,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:53,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:53,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:53,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:53,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:53,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 15:26:53,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:26:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:26:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:26:53,351 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 15 states. [2018-11-18 15:26:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:53,535 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-11-18 15:26:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:26:53,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2018-11-18 15:26:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:53,536 INFO L225 Difference]: With dead ends: 295 [2018-11-18 15:26:53,536 INFO L226 Difference]: Without dead ends: 293 [2018-11-18 15:26:53,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:26:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-18 15:26:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-11-18 15:26:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-18 15:26:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 409 transitions. [2018-11-18 15:26:53,550 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 409 transitions. Word has length 124 [2018-11-18 15:26:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:53,550 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 409 transitions. [2018-11-18 15:26:53,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:26:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 409 transitions. [2018-11-18 15:26:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:26:53,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:53,551 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:53,552 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:53,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -730440230, now seen corresponding path program 2 times [2018-11-18 15:26:53,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:53,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:53,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:53,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:53,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 15:26:53,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:53,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:53,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:53,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:53,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-18 15:26:54,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 15:26:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 15:26:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-18 15:26:54,090 INFO L87 Difference]: Start difference. First operand 293 states and 409 transitions. Second operand 21 states. [2018-11-18 15:26:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:54,218 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2018-11-18 15:26:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:26:54,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2018-11-18 15:26:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:54,219 INFO L225 Difference]: With dead ends: 338 [2018-11-18 15:26:54,220 INFO L226 Difference]: Without dead ends: 334 [2018-11-18 15:26:54,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-18 15:26:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-18 15:26:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2018-11-18 15:26:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 15:26:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 461 transitions. [2018-11-18 15:26:54,228 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 461 transitions. Word has length 135 [2018-11-18 15:26:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:54,228 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 461 transitions. [2018-11-18 15:26:54,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 15:26:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 461 transitions. [2018-11-18 15:26:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 15:26:54,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:54,230 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:54,230 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:54,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash -449262532, now seen corresponding path program 2 times [2018-11-18 15:26:54,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:54,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:54,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:54,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:54,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:54,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:54,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:26:54,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:26:54,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:54,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:54,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:54,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 15:26:54,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 15:26:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:26:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:26:54,733 INFO L87 Difference]: Start difference. First operand 329 states and 461 transitions. Second operand 16 states. [2018-11-18 15:26:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:54,912 INFO L93 Difference]: Finished difference Result 331 states and 462 transitions. [2018-11-18 15:26:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:26:54,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 139 [2018-11-18 15:26:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:54,914 INFO L225 Difference]: With dead ends: 331 [2018-11-18 15:26:54,914 INFO L226 Difference]: Without dead ends: 329 [2018-11-18 15:26:54,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:26:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-18 15:26:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-11-18 15:26:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 15:26:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2018-11-18 15:26:54,926 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 139 [2018-11-18 15:26:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:54,927 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2018-11-18 15:26:54,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 15:26:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-11-18 15:26:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 15:26:54,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:26:54,928 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:26:54,928 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:26:54,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:26:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1381697249, now seen corresponding path program 3 times [2018-11-18 15:26:54,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:26:54,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:26:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:54,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:26:54,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:26:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:26:55,631 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-18 15:26:55,866 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-18 15:26:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:26:55,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:26:55,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:26:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:26:55,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 15:26:55,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:26:55,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:26:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-18 15:26:56,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:26:56,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2018-11-18 15:26:56,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 15:26:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 15:26:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-18 15:26:56,184 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand 23 states. [2018-11-18 15:26:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:26:57,028 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2018-11-18 15:26:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 15:26:57,028 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2018-11-18 15:26:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:26:57,029 INFO L225 Difference]: With dead ends: 349 [2018-11-18 15:26:57,029 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:26:57,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=2059, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 15:26:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:26:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:26:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:26:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:26:57,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-18 15:26:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:26:57,031 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:26:57,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 15:26:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:26:57,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:26:57,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:26:57,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:26:57,212 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 132 [2018-11-18 15:26:57,580 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2018-11-18 15:26:57,680 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 15:26:57,681 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-18 15:26:57,681 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-18 15:26:57,682 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-18 15:26:57,683 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-18 15:26:57,684 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-18 15:26:57,684 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-18 15:26:57,685 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-18 15:26:57,685 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-18 15:26:57,685 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-18 15:26:57,685 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-18 15:26:57,685 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-18 15:26:57,685 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-18 15:26:57,686 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse6 (<= main_~this_buffer_empty~0 1)) (.cse7 (<= 1 main_~this_buffer_empty~0)) (.cse5 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse2 (<= main_~P8~0 2147483647)) (.cse3 (<= main_~this_buffer_empty~0 0)) (.cse4 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 (and .cse1 (= main_~q~0 3) .cse2 .cse3 .cse4)) (and .cse5 (= main_~q~0 1) .cse6 .cse1 .cse7 .cse2) (and .cse0 .cse6 .cse1 (= main_~q~0 4) .cse7 .cse2) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse3 .cse4) (and .cse5 (<= 5 main_~q~0) .cse1 .cse2 .cse3 .cse4))) [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-18 15:26:57,687 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-18 15:26:57,687 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-18 15:26:57,688 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-18 15:26:57,689 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-18 15:26:57,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:26:57 BoogieIcfgContainer [2018-11-18 15:26:57,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:26:57,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:26:57,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:26:57,720 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:26:57,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:26:31" (3/4) ... [2018-11-18 15:26:57,731 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:26:57,738 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:26:57,739 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:26:57,745 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-18 15:26:57,745 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 15:26:57,769 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-18 15:26:57,776 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_659f4d0f-860b-47cf-8e05-5fc9f174f834/bin-2019/uautomizer/witness.graphml [2018-11-18 15:26:57,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:26:57,777 INFO L168 Benchmark]: Toolchain (without parser) took 27283.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 505.4 MB). Free memory was 959.1 MB in the beginning and 1.4 GB in the end (delta: -405.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:26:57,778 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:26:57,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.63 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:26:57,778 INFO L168 Benchmark]: Boogie Preprocessor took 87.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:26:57,779 INFO L168 Benchmark]: RCFGBuilder took 660.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:26:57,779 INFO L168 Benchmark]: TraceAbstraction took 26158.11 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -275.8 MB). Peak memory consumption was 557.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:26:57,779 INFO L168 Benchmark]: Witness Printer took 57.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:26:57,781 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.63 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 660.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26158.11 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -275.8 MB). Peak memory consumption was 557.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-11-18 15:26:57,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((0 <= P8 + 2147483648 && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-18 15:26:57,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 15:26:57,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 26.0s OverallTime, 28 OverallIterations, 14 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5548 SDtfs, 3974 SDslu, 35044 SDs, 0 SdLazy, 4276 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1872 GetRequests, 1586 SyntacticMatches, 30 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 128 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 49 NumberOfFragments, 204 HoareAnnotationTreeSize, 7 FomulaSimplifications, 13330 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1107 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3350 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3387 ConstructedInterpolants, 42 QuantifiedInterpolants, 3415149 SizeOfPredicates, 70 NumberOfNonLiveVariables, 10039 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 1137/5980 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...